A323901 a(n) = A002487(A163511(n)).

1, 1, 1, 2, 1, 4, 2, 3, 1, 8, 4, 7, 2, 4, 3, 3, 1, 14, 8, 11, 4, 18, 7, 9, 2, 12, 4, 9, 3, 8, 3, 5, 1, 22, 14, 43, 8, 34, 11, 47, 4, 16, 18, 23, 7, 26, 9, 13, 2, 16, 12, 23, 4, 18, 9, 17, 3, 6, 8, 11, 3, 6, 5, 5, 1, 64, 22, 127, 14, 112, 43, 97, 8, 84, 34, 121, 11, 26, 47, 111, 4, 66, 16, 89, 18, 40, 23, 57, 7, 36, 26, 57, 9, 50, 13, 29, 2, 50

Offset: 0

Author

Antti Karttunen, Feb 09 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16384
• Index entries for sequences related to binary expansion of n
• Index entries for sequences computed from indices in prime factorization
• Index entries for sequences related to Stern's sequences

Crossrefs

Cf. A002487, A163511.

Cf. also A323902, A323903.

Programs

PARI

A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A054429(n) = ((3<<#binary(n\2))-n-1); \\ From A054429
A163511(n) = if(!n,1,A005940(1+A054429(n)));
A323901(n) = A002487(A163511(n));

Formula

a(n) = A002487(A163511(n)).

a(2^n) = 1 for all n >= 0.