proposed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
<a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
Antti Karttunen, <a href="/A246363/b246363.txt">Table of n, a(n) for n = 1..10000</a>
1, 2, 4, 8, 3, 9, 5, 13, 10, 16, 6, 14, 7, 12, 35, 20, 17, 79, 11, 67, 71, 33, 19, 271, 39, 31, 139, 87, 15, 30, 18, 311, 47, 34, 63, 74, 23, 29, 26, 351, 21, 28, 27, 24, 303, 69, 25, 2431, 70, 223, 135, 319, 37, 1663, 65, 58, 41, 38, 32, 219, 43, 127, 367, 327, 287, 239, 55, 107, 46, 283, 22, 413, 51, 53, 147
1,2
(PARI)
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ Using code of Michel Marcus
A048673(n) = (A003961(n)+1)/2;
A135141(n) = if(1==n, 1, if(isprime(n), 2*A135141(primepi(n)), 1+(2*A135141(n-primepi(n)-1))));
A246363(n) = A135141(A048673(n));
for(n=1, 10000, write("b246363.txt", n, " ", A246363(n)));
allocated
nonn
Antti Karttunen, Aug 26 2014
approved
editing
allocated for Antti Karttunen
allocated
approved