login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323903 a(n) = A002487(A122111(n)). 6
1, 1, 1, 2, 1, 2, 1, 3, 4, 2, 1, 3, 1, 2, 4, 3, 1, 4, 1, 3, 4, 2, 1, 3, 8, 2, 7, 3, 1, 4, 1, 5, 4, 2, 8, 8, 1, 2, 4, 3, 1, 4, 1, 3, 7, 2, 1, 5, 14, 12, 4, 3, 1, 9, 8, 3, 4, 2, 1, 8, 1, 2, 7, 5, 8, 4, 1, 3, 4, 12, 1, 6, 1, 2, 18, 3, 14, 4, 1, 5, 9, 2, 1, 8, 8, 2, 4, 3, 1, 9, 14, 3, 4, 2, 8, 5, 1, 16, 7, 6, 1, 4, 1, 3, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..16384

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Index entries for sequences computed from indices in prime factorization

Index entries for sequences related to Stern's sequences

FORMULA

a(n) = A002487(A122111(n)) = A002487(A322865(n)).

a(p) = 1 for all primes p.

PROG

(PARI)

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

A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};

A122111(n) = if(1==n, n, prime(bigomega(n))*A122111(A064989(n)));

A323903(n) = A002487(A122111(n));

CROSSREFS

Cf. A002487, A122111, A322865.

Cf. also A323168, A323174, A323902.

Sequence in context: A325702 A304746 A304748 * A329382 A322826 A133117

Adjacent sequences:  A323900 A323901 A323902 * A323904 A323905 A323906

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 09 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 24 04:25 EDT 2021. Contains 346273 sequences. (Running on oeis4.)