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.

A066504 Sum of n/p^k over all maximal prime-power divisors of n.

Original entry on oeis.org

0, 1, 1, 1, 1, 5, 1, 1, 1, 7, 1, 7, 1, 9, 8, 1, 1, 11, 1, 9, 10, 13, 1, 11, 1, 15, 1, 11, 1, 31, 1, 1, 14, 19, 12, 13, 1, 21, 16, 13, 1, 41, 1, 15, 14, 25, 1, 19, 1, 27, 20, 17, 1, 29, 16, 15, 22, 31, 1, 47, 1, 33, 16, 1, 18, 61, 1, 21, 26, 59, 1, 17, 1, 39, 28, 23, 18, 71, 1, 21, 1, 43, 1
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 04 2002

Keywords

Comments

a(A000961(m)) = 1; a(A001358(m)) = A008472(A001358(m)).

Examples

			a(120) = 120/2^3 + 120/3^1 + 120/5^1 = 15 + 40 + 24 = 79.
		

References

  • R. K. Guy, Unsolved Problems in Number Theory, B8.

Crossrefs

Cf. A005236.
Cf. A028236. - R. J. Mathar, Sep 30 2008

Programs

  • Mathematica
    f[n_ ] := n*Plus @@ (1/#[[1]]^#[[2]] & /@ FactorInteger@n); Array[f, 83] (* Robert G. Wilson v *)
  • PARI
    { for (n=1, 1000, f=factor(n); a=sum(i=1, matsize(f)[1], n/(f[i, 1]^f[i, 2])); write("b066504.txt", n, " ", a) ) } \\ Harry J. Smith, Feb 18 2010

Extensions

More terms from Robert G. Wilson v, Dec 06 2005

A068597 Barriers for bigomega(n): numbers n such that, for all m < n, m + bigomega(m) <= n.

Original entry on oeis.org

2, 3, 4, 6, 8, 12, 24, 48, 60, 108, 168, 264, 348, 360, 384, 480, 720, 864, 888, 1020, 1320, 1440, 2040, 2064, 2448, 2880, 3024, 3120, 3168, 3624, 4680, 4920, 5388, 5400, 5880, 6600, 6720, 6984, 7080, 7560, 8424, 8700, 8784, 9744, 9840, 9888, 10080
Offset: 1

Views

Author

Naohiro Nomoto, Mar 28 2002

Keywords

References

  • R. K. Guy, Unsolved Problems in Number Theory, B8.

Crossrefs

Cf. A005236.

Programs

  • Mathematica
    omegaBarrierQ[n_] := (For[m = 1, m < n, m++, If[m + PrimeOmega[m] > n, Return[False]]]; True); Select[Range[2, 1100], omegaBarrierQ] (* Amiram Eldar after Jean-François Alcover at A005236 *)
  • PARI
    is(n)=if(isprime(n-1) && isprime(n\2-1),for(k=3,log(n)\log(2),if(bigomega(n-k)>k,return(0)));1, n<5 && n>1) \\ Charles R Greathouse IV, Sep 20 2012
Showing 1-2 of 2 results.