login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324872 a(n) = A001222(n) + A061395(n) - A324861(n). 4
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,50

COMMENTS

Records 0, 1, 2, 6, 7, 10, 14, etc., occur at n = 1, 2, 50, 125, 243, 1729, 8192, etc.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000 (based on Hans Havermann's factorization of A156552)

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 sigma(n)

FORMULA

a(n) = A001222(n) + A061395(n) - A324861(n).

a(n) = 1 + A252464(n) - A324861(n).

a(p) = 1 for all primes p.

PROG

(PARI)

A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));

A324861(n) = #binary(A324876(n)); \\ Needs also code from A324876.

A324872(n) = (bigomega(n)+A061395(n)-A324861(n));

CROSSREFS

Cf. A001222, A061395, A252464, A324861, A324870, A324876.

Sequence in context: A156264 A249770 A298481 * A307608 A323022 A284562

Adjacent sequences:  A324869 A324870 A324871 * A324873 A324874 A324875

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 21 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 October 20 04:37 EDT 2019. Contains 328247 sequences. (Running on oeis4.)