This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A323901 #7 Feb 10 2019 23:06:18 %S A323901 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, %T A323901 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, %U A323901 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 %N A323901 a(n) = A002487(A163511(n)). %H A323901 Antti Karttunen, <a href="/A323901/b323901.txt">Table of n, a(n) for n = 0..16384</a> %H A323901 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A323901 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A323901 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a> %F A323901 a(n) = A002487(A163511(n)). %F A323901 a(2^n) = 1 for all n >= 0. %o A323901 (PARI) %o A323901 A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487 %o A323901 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940 %o A323901 A054429(n) = ((3<<#binary(n\2))-n-1); \\ From A054429 %o A323901 A163511(n) = if(!n,1,A005940(1+A054429(n))); %o A323901 A323901(n) = A002487(A163511(n)); %Y A323901 Cf. A002487, A163511. %Y A323901 Cf. also A323902, A323903. %K A323901 nonn %O A323901 0,4 %A A323901 _Antti Karttunen_, Feb 09 2019