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.

A221867 Let m = A153022(n); a(n) = (1 + sum_{i=1..m} prime(i)^2)/(1+m).

Original entry on oeis.org

54, 218, 222054, 669806, 155593313228, 31860927184920, 37843679840313254, 5349233671440437948, 65075392901385088766, 102744428793110424984, 251471854505406311064463, 1074272348712875302655077, 1114427338015137279788981
Offset: 1

Views

Author

Robert Price, Apr 10 2013

Keywords

Examples

			For n=2, m=10, a(2) = 2398/11=218.
		

Crossrefs

Extensions

Definition corrected by N. J. A. Sloane, Apr 20 2013

A158682 Numbers n such that 1 plus the sum of the first n primes is divisible by n+1.

Original entry on oeis.org

2, 6, 224, 486, 734, 50046, 142834, 170208, 249654, 316585342, 374788042, 2460457826, 2803329304, 6860334656, 65397031524, 78658228038
Offset: 1

Views

Author

Ctibor O. Zizka, Mar 24 2009

Keywords

Comments

a(17) > pi(4*10^12). - Donovan Johnson, Jul 02 2010

Crossrefs

Programs

  • Mathematica
    k = 0; s = 1; p = 2; lst = {}; While[k < 10^9, s = s + p; If[ Mod[s, ++k + 1] == 0, AppendTo[lst, k]; Print[{k, p}]]; p = NextPrime@ p]

Extensions

a(6)-a(8) from R. J. Mathar, Mar 26 2009
a(9)-a(11) from Donovan Johnson, Nov 15 2009
a(12)-a(13) from Ray Chandler, May 31 2010
a(14)-a(16) from Donovan Johnson, Jul 02 2010
Showing 1-2 of 2 results.