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!)
A339895 a(n) = A339894(n) - A061395(n). 7
0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 1, 2, 0, 0, 1, 1, 0, 1, 0, 1, 2, 0, 0, 2, 2, 2, 1, 1, 0, 3, 1, 1, 1, 0, 0, 2, 0, 0, 2, 2, 1, 1, 0, 1, 1, 2, 0, 3, 0, 0, 3, 1, 2, 1, 0, 2, 3, 0, 0, 2, 1, 0, 1, 1, 0, 3, 2, 1, 1, 0, 1, 2, 0, 3, 2, 2, 0, 1, 0, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,27
LINKS
FORMULA
a(n) = A339894(n) - A061395(n).
a(n) = A334201(n) - A339896(n).
a(n) = A339893(A122111(n)).
PROG
(PARI)
A000523(n) = if( n<1, 0, #binary(n) - 1); \\ From A000523
A122111(n) = if(1==n, n, my(f=factor(n), es=Vecrev(f[, 2]), is=concat(apply(primepi, Vecrev(f[, 1])), [0]), pri=0, m=1); for(i=1, #es, pri += es[i]; m *= prime(pri)^(is[i]-is[1+i])); (m));
A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
A339895(n) = (A339894(n)-A061395(n));
CROSSREFS
Cf. A339897 (first occurrence of each n).
Sequence in context: A130161 A115672 A079694 * A068906 A162514 A364039
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 21 2020
STATUS
approved

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 19 05:02 EDT 2024. Contains 371782 sequences. (Running on oeis4.)