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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A144776 Define f(n) = 1 if n is prime, 2 * rad(n) if four divides n and rad(n) otherwise: then a(n) = 0 for composite n where f(n) is not less than n and otherwise equals the number of positive integers k less than n for which f(k) < f(n). 1
 0, 0, 0, 0, 0, 0, 0, 5, 5, 0, 0, 0, 0, 0, 0, 8, 0, 12, 0, 0, 0, 0, 0, 17, 14, 0, 10, 0, 0, 0, 0, 14, 0, 0, 0, 22, 0, 0, 0, 28, 0, 0, 0, 0, 29, 0, 0, 26, 25, 26, 0, 0, 0, 24, 0, 42, 0, 0, 0, 0, 0, 0, 41, 21, 0, 0, 0, 0, 0, 0, 0, 35, 0, 0, 42, 0, 0, 0, 0, 46, 23, 0, 0, 0, 0, 0, 0, 64, 0, 58, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS For the given terms, nearly all n for which a(n) obtains a new maximum are multiples of eight. Only 18, 36 and 45 are not. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 EXAMPLE f(8) = 4 and f(9) = 3. For 1, 2, 3, 5 and 7, f(k) = 1, so a(8) = a(9) = 5. PROG (PARI) A007947(n) = factorback(factorint(n)[, 1]); f(n) = if(isprime(n), 1, if(n%4, A007947(n), 2*A007947(n))); A144776(n) = if(n<2, 0, my(x=f(n)); if(!isprime(n)&&(x>=n), 0, sum(k=1, n-1, (f(k)

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.

Last modified March 20 21:56 EDT 2023. Contains 361391 sequences. (Running on oeis4.)