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.

Previous Showing 71-80 of 141 results. Next

A128170 Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^6.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 27, 28, 29, 34, 36, 42, 45, 48, 54, 56, 63, 72, 84, 112, 126, 159, 168, 174, 198, 204, 216, 252, 310, 312, 336, 360, 400, 408, 441, 504, 505, 540, 588, 591, 657, 672, 716, 864, 900, 1080, 1152, 1316, 1350, 1380, 1680, 1722
Offset: 1

Views

Author

Alexander Adamchuk, Feb 22 2007

Keywords

Comments

a(301) > 1.4*10^13. - Bruce Garner, Apr 07 2021

Links

Crossrefs

Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Programs

  • Mathematica
    s = 1; Do[s = s + Prime[n]^6; If[ Mod[s, n] == 0, Print[n]], {n, 10000}]
Module[{nn=1750,pr},pr=Accumulate[Prime[Range[nn]]^6];Select[Thread[ {Range[ nn],pr}],Divisible[#[[2]]+1,#[[1]]]&]][[All,1]] (* Harvey P. Dale, Feb 10 2019 *)
  • PARI
    n=0; s=1; forprime(p=2,,s+=p^6; if(s%n++==0, print1(n", "))) \\ Charles R Greathouse IV, Dec 03 2013

A128171 Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^7.

Original entry on oeis.org

1, 2, 4, 5, 6, 10, 12, 46, 1830, 2086, 6000, 7681, 8242, 15204, 43698, 52054, 154490, 211052, 392767, 4309540, 6452151, 8773101, 15166410, 26552623, 176656106, 180281161, 568507964, 608235488, 620790480, 1053296976, 1627363527, 3740702866, 20254119186
Offset: 1

Views

Author

Alexander Adamchuk, Feb 22 2007, Feb 23 2007

Keywords

Comments

a(43) > 1.4*10^13. - Bruce Garner, Apr 07 2021

Links

Crossrefs

Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Programs

  • Mathematica
    s = 1; Do[s = s + Prime[n]^7; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]

Extensions

More terms from Sean A. Irvine, Jan 18 2011
a(27)-a(35) from Robert Price, Dec 03 2013

A131273 Numbers k that divide Sum_{j=1..k} prime(j)^13.

Original entry on oeis.org

1, 23, 299, 313, 171287, 435705, 487475, 3774601, 219347813, 9613155161, 5150163868035, 37365789554345, 228914067371295
Offset: 1

Views

Author

Alexander Adamchuk, Jun 25 2007

Keywords

Comments

a(13) > 4*10^13. - Bruce Garner, Aug 30 2021
a(14) > 5*10^14. - Paul W. Dyson, Dec 06 2024

Links

Crossrefs

Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Programs

  • Mathematica
    s = 0; Do[s = s + Prime[n]^13; If[ Mod[s, n] == 0, Print[n]], {n, 200000}]
  • PARI
    S=n=0;forprime(p=1,,(S+=p^13)%n++||print1(n",")) \\ M. F. Hasler, Dec 01 2013

Extensions

a(6)-a(8) from Robert G. Wilson v, Jun 30 2007
a(9)-a(10) from Robert Price, Nov 28 2013
a(11) from Bruce Garner, Mar 23 2021
a(12) from Bruce Garner, Aug 30 2021
a(13) from Paul W. Dyson, Apr 20 2023

A131591 Sum of the squares of the first 3^n primes.

Original entry on oeis.org

4, 38, 1556, 86606, 4083404, 171658094, 6716224724, 247782290006, 8763080657420, 299863491723614, 9990667099305740, 325847250824377382, 10445562407382412028, 330039152364735149222, 10301457052184951857604, 318211810358946705058382
Offset: 0

Views

Author

Cino Hilliard, Aug 30 2007

Keywords

Examples

			The sum of the squares of the first 3^1 primes is 4 + 9 + 25 = 38, the second term of this sequence.

Links

Crossrefs

Cf. A001248, A024450, A131590.

Programs

  • Mathematica
    nn=15;With[{prsq=Prime[Range[3^nn]]^2},Table[Total[Take[prsq,3^n]],{n,0,nn}]] (* Harvey P. Dale, Mar 08 2014 *)
  • PARI
    sumprimesq(n,b) = { local(x,y,s,a); for(y=0,n, s=0; for(x=1,b^y, s+=prime(x)^2; ); print1(s","); ) }
  • PARI
    lista(pmax) = {my(sm = 0, c = 0, pow = 1); forprime(p = 1, pmax, sm += p^2; c++; if(c == pow, print1(sm, ", "); pow *= 3));} \\ Amiram Eldar, Jul 06 2024

Formula

a(n) = A024450(3^n). - Amiram Eldar, Jul 06 2024

Extensions

More terms from Harvey P. Dale, Mar 08 2014

A133549 Sum of the fourth powers of the first n odd primes.

Original entry on oeis.org

81, 706, 3107, 17748, 46309, 129830, 260151, 539992, 1247273, 2170794, 4044955, 6870716, 10289517, 15169198, 23059679, 35177040, 49022881, 69174002, 94585683, 122983924, 161934005, 209392326, 272134567, 360663848, 464724249, 577275130
Offset: 1

Views

Author

Artur Jasinski, Sep 16 2007

Keywords

Examples

			a(2)=706 because 3^4 + 5^4 = 706.

Crossrefs

Cf. A007148, A007504, A024450, A098999, A122102, A133547, A133548, A133550, A133551.

Programs

  • Maple
    a:=proc (n) options operator, arrow: add(ithprime(j)^4, j=2..n+1) end proc: seq(a(n),n=1..26); # Emeric Deutsch, Oct 02 2007
  • Mathematica
    c = 4; a = {}; b = 0; Do[b = b + Prime[n]^c; AppendTo[a, b], {n, 2, 1000}]; a

Formula

a(n) = A122102(n+1) - 16. - Michel Marcus, Nov 05 2013

Extensions

Comment corrected by Michel Marcus, Nov 05 2013

A223939 Integer averages of first k primes cubed for some k (a(n) = A223937(n)/A122140(n)).

Original entry on oeis.org

8, 187858, 13080918308, 26871014202, 29988975981350, 773478679579793136, 8923646993118036400, 545048444084018901462938808502760, 22049455928935679528789623492181708, 180819643079146957138056211903672348
Offset: 1

Views

Author

Robert Price, Mar 29 2013

Keywords

Examples

			The integer, 187858 is the average of the first 25 primes^3 (4696450/25=187858).

Links

Crossrefs

Cf. A122140, A223937.
Cf. A085450 (smallest m > 1 that divides Sum_{k=1..m} prime(k)^n).
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

A224084 a(n) is the sum of the first A122142(n) primes.

Original entry on oeis.org

32, 29014217650, 1402410522779408458962, 242700813972473727979856438, 39801461997088304647457657686237500, 34660028355420445358269199690982103830, 449313345166550298019555516465462404833615242, 521622464603890911352361262823355004060722502
Offset: 1

Views

Author

Robert Price, Mar 30 2013

Keywords

Comments

a(15) > 396037728209314158966816617669123060098902457685060543657534165383\
2287251689417. - Paul W. Dyson, Jan 04 2021
a(16) > 741988146562261280623405653926334331812789175312248159249998073717\
183180285452620103675. - Bruce Garner, May 09 2021
a(17) > 829476776252760811662536439998983292156543518510986088858270226839\
9456611816755432572891181. - Paul W. Dyson, Feb 04 2022

Links

Crossrefs

Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

A224087 Integer averages of first k primes to the fifth power for some k (A224083/A122142).

Original entry on oeis.org

32, 1160568706, 1675520337848755626, 47319324229376823548422, 421737345664511837324054650980, 127677705617374045855890076772262, 125639284519521689545001188816411980826, 142455227153563701959237947286559180978
Offset: 1

Views

Author

Robert Price, Mar 30 2013

Keywords

Examples

			The integer, 1160568706 is the average of p^5 for the first 25 primes p (29014217650/25 = 1160568706); 25 being A085450(5).

Links

Crossrefs

Cf. A085450, A122142, A224083.
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

A232733 Prime(m), where m is such that (Sum_{i=1..m} prime(i)^6) / m is an integer.

Original entry on oeis.org

2, 41647, 3197891, 630397289, 779089704751, 3819383648849, 44041722668737, 1322879640047263, 9863536132182127, 16069251644649407, 32520030920151967
Offset: 1

Views

Author

Robert Price, Dec 02 2013

Keywords

Comments

The primes correspond to indices n = 1, 4357, 230065, 32826947, 29578097627 = A125825.
a(12) > 3.7*10^16. - Paul W. Dyson, Jan 17 2025

Examples

			a(2) = 41647, because 41647 is the 4357th prime and the sum of the first 4357 primes^6 = 2952411812082729747782733271068 when divided by 4357 equals 677624928180566845945084524 which is an integer.

Links

Crossrefs

Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Programs

  • Mathematica
    t = {}; sm = 0; Do[sm = sm + Prime[n]^6; If[Mod[sm, n] == 0, AppendTo[t, Prime[n]]], {n, 100000}]; t (* Derived from A217599 *)
  • PARI
    is(n)=if(!isprime(n),return(0)); my(t=primepi(n),s); forprime(p=2,n,s+=Mod(p,t)^6); s==0 \\ Charles R Greathouse IV, Nov 30 2013
  • PARI
    S=n=0;forprime(p=1,,(S+=p^6)%n++||print1(p",")) \\ M. F. Hasler, Dec 01 2013

Formula

a(n) = prime(A125828(n)).

Extensions

a(6) from Bruce Garner, Jul 10 2021
a(7) from Paul W. Dyson, Jan 08 2021
a(8) from Bruce Garner, Jul 10 2021
a(9) from Paul W. Dyson, Oct 21 2022
a(10) from Paul W. Dyson, Oct 31 2022
a(11) from Paul W. Dyson, Dec 08 2022

A232823 Numbers k such that k divides 1 + Sum_{j=1..k} (prime(j)^8).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 20, 24, 28, 30, 32, 37, 39, 40, 45, 48, 60, 64, 80, 90, 96, 100, 104, 120, 133, 160, 168, 174, 180, 205, 211, 240, 247, 320, 360, 456, 480, 512, 540, 560, 563, 580, 676, 692, 735, 820, 864, 930, 960, 1215, 1216, 1368
Offset: 1

Views

Author

Robert Price, Nov 30 2013

Keywords

Comments

a(305) > 1.2*10^14. - Bruce Garner, Mar 20 2022

Examples

			a(7)=8 because 1 plus the sum of the first 8 primes^8 is 24995572328 which is divisible by 8.

Links

Crossrefs

Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.
Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Programs

  • Mathematica
    p = 2; k = 0; s = 1; lst = {}; While[k < 521330000, s = s + p^8; If[Mod[s, ++k] == 0, AppendTo[lst, k]; Print[{k, p}]]; p = NextPrime@ p](* Derived from A128169 *)
With[{nn=1400},Select[Thread[{Range[nn],Accumulate[Prime[Range[nn]]^8]+1}],Mod[ #[[2]],#[[1]]] == 0&]][[;;,1]] (* Harvey P. Dale, Jul 20 2024 *)
Previous Showing 71-80 of 141 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.