cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A144775 Define f(n) = 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).

Original entry on oeis.org

0, 1, 2, 0, 4, 0, 6, 3, 2, 0, 10, 0, 12, 0, 0, 4, 16, 8, 18, 0, 0, 0, 22, 13, 7, 0, 2, 0, 28, 0, 30, 5, 0, 0, 0, 16, 36, 0, 0, 24, 40, 0, 42, 0, 21, 0, 46, 16, 13, 15, 0, 0, 52, 11, 0, 35, 0, 0, 58, 0, 60, 0, 31, 5, 0, 0, 66, 0, 0, 0, 70, 20, 72, 0, 27, 0, 0, 0, 78, 32, 2, 0, 82, 0, 0, 0, 0, 55
Offset: 1

Views

Author

Reikku Kulon, Sep 21 2008

Keywords

Comments

This sequence obtains a new maximum a(n) = n - 1 for prime n.
a(n) = 0 often, but not always, when n - 1 and n + 1 are twin primes.

Examples

			f(8) = 2 * rad(8) = 4. f(k) < 4 for 1, 2 and 3 (f(k) = k for 0 < k < 8); a(8) = 3.
		

Crossrefs

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).

Original entry on oeis.org

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
Offset: 1

Views

Author

Reikku Kulon, Sep 21 2008

Keywords

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.

Examples

			f(8) = 4 and f(9) = 3. For 1, 2, 3, 5 and 7, f(k) = 1, so a(8) = a(9) = 5.
		

Crossrefs

Programs

  • 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)Antti Karttunen, Jul 03 2018
Showing 1-2 of 2 results.