1,3

The recursion start is implicit in the rule, since the rule demands that a(1)=2*a(1). All other terms are defined through terms for smaller indices until a(1) is reached.

a(n) is a bijective mapping from the positive integers to the nonnegative integers. Given the value of a(n), you can get back to n using the following algorithm:

Start with an initial value of k=1 and write a(n) in binary representation. Then for each bit, starting with the most significant one, do the following: - if the bit is 1, replace k by the k-th prime - if the bit is 0, replace k by the k-th nonprime After you processed the last (i.e. least significant) bit of a(n), you've got n=k.

Example: From a(n)=12=bin(1100),you get 1->2->3=>6=>10; a(10)=12. Here -> are the steps due to binary digit 1, => are the steps due to binary digit 0.

The following sequences all appear to have the same parity (with an extra zero term at the start of A010051): A010051, A061007, A035026, A069754, A071574. - Jeremy Gardiner (jeremy.gardiner(AT)btinternet.com), Aug 09, 2002

T. D. Noe, Table of n, a(n) for n=1..10000

1 is the first nonprime, so f(1) = 2*f(1), therefore f(1) = 0; 2 is the first prime, so f(2) = 2*f(1)+1 = 2*0+1 = 1; 4 is the 2nd nonprime, so f(4) = 2*f(2) = 2*1 = 2

a[1] = 0 a[n_] := If[PrimeQ[n], 2*a[PrimePi[n]] + 1, 2*a[n - PrimePi[n]]]

Adjacent sequences: A071571 A071572 A071573 this_sequence A071575 A071576 A071577

Sequence in context: A072764 A130328 A083569 this_sequence A054429 A126316 A101224

easy,nice,nonn

Christopher Eltschka (celtschk(AT)web.de), May 31 2002