login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331601 a(n) = A002487(A241909(n)). 3

%I #8 Jan 25 2020 20:53:27

%S 1,1,1,2,1,4,1,3,2,8,1,7,1,14,4,3,1,4,1,11,8,22,1,9,2,64,3,43,1,18,1,

%T 5,14,110,4,9,1,162,22,47,1,34,1,127,7,440,1,13,2,12,64,191,1,8,8,97,

%U 110,1002,1,23,1,752,11,5,14,112,1,1249,162,16,1,17,1,610,4,897,4,220,1,111,3,4882,1,121,22,5494,440,281,1,26,8,7623,1002

%N a(n) = A002487(A241909(n)).

%H Antti Karttunen, <a href="/A331601/b331601.txt">Table of n, a(n) for n = 1..16384</a>

%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>

%H <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a>

%F a(n) = A002487(A241909(n)).

%F a(n) = A002487(A331732(n)).

%o (PARI)

%o A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487

%o A241909(n) = if(1==n||isprime(n),2^primepi(n),my(f=factor(n),h=1,i,m=1,p=1,k=1); while(k<=#f~, p = nextprime(1+p); i = primepi(f[k,1]); m *= p^(i-h); h = i; if(f[k,2]>1, f[k,2]--, k++)); (p*m));

%o A331601(n) = A002487(A241909(n));

%Y Cf. A002487, A241909, A331732.

%Y Cf. also A323901, A323902, A323903, A331600.

%K nonn

%O 1,4

%A _Antti Karttunen_, Jan 22 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 09:22 EDT 2024. Contains 371905 sequences. (Running on oeis4.)