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 31-40 of 56 results. Next

A254413 Primes in the 8th-order Fibonacci numbers A123526.

Original entry on oeis.org

29, 113, 449, 226241, 14307889, 113783041, 1820091580429249, 233322881089059894782836851617, 29566627412209231076314948970028097, 59243719929958343565697204780596496129, 7507351981539044730893385057192143660843521
Offset: 1

Views

Author

Robert Price, Jan 30 2015

Keywords

Comments

a(12) is too large to display here. It has 46 digits and is the 158th term in A123526.

Crossrefs

Programs

  • Mathematica
    a={1,1,1,1,1,1,1,1}; step=8; lst={}; For[n=step+1,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,sum]]; a=RotateLeft[a]; a[[step]]=sum]; lst
    Select[With[{lr=PadRight[{},8,1]},LinearRecurrence[lr,lr,200]],PrimeQ] (* Harvey P. Dale, Dec 03 2022 *)

A242315 Indices of primes in the tribonacci-like sequence A214826.

Original entry on oeis.org

4, 7, 23, 71, 379, 467, 596, 6372, 10100, 11660, 23099, 25419, 26011, 36588, 76895, 112867
Offset: 1

Views

Author

Robert Price, May 10 2014

Keywords

Comments

a(17) > 2*10^5.

Crossrefs

Programs

  • Mathematica
    a={1,4,4}; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]

A244930 Indices of primes in A214831.

Original entry on oeis.org

3, 4, 7, 8, 16, 26, 34, 42, 78, 94, 101, 107, 216, 255, 543, 562, 851, 981, 1099, 1528, 1824, 1955, 2122, 2488, 2500, 15331, 15961, 24107, 24938, 26051, 58504, 61617, 81034, 85119, 89768, 90597, 97191, 116899, 195346
Offset: 1

Views

Author

Robert Price, Jul 08 2014

Keywords

Comments

a(40) > 2*10^5.

Crossrefs

Programs

A244931 Prime terms in A214831.

Original entry on oeis.org

19, 37, 223, 409, 53617, 23757289, 3111662089, 407556643177, 1372675688565303822697, 23548271681390871672120649, 1676892190264006259992141409, 64923481849284379431377700019
Offset: 1

Views

Author

Robert Price, Jul 08 2014

Keywords

Comments

a(13) has 58 digits and thus is too large to display here. It corresponds to A214831(216).

Crossrefs

Programs

  • Mathematica
    a={1,9,9}; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[3]]=sum]

A248700 Indices of primes in the Heptanacci numbers sequence A122189.

Original entry on oeis.org

8, 14, 22, 102495, 130447, 173590
Offset: 1

Views

Author

Robert Price, Dec 02 2014

Keywords

Comments

a(7) > 2*10^5.

Crossrefs

Programs

  • Mathematica
    a={0,0,0,0,0,0,1}; For[n=7, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[7]]=sum]

A248921 Primes in the pentanacci numbers sequence A000322.

Original entry on oeis.org

5, 17, 977, 28697, 56417, 1428864769, 2809074173, 21344178433, 626815657409, 18407729752001, 2317881588988297338942875602391948125494800020122167809, 136507010958920295813169620935932629930648432530102206331972221346174230852977164801
Offset: 1

Views

Author

Robert Price, Oct 16 2014

Keywords

Comments

a(13) is too large to display here. It has 132 digits and is the 450th term in A000322.

Crossrefs

Programs

  • Mathematica
    a={1,1,1,1,1}; For[n=5, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[5]]=sum]
    Select[With[{c={1,1,1,1,1}},LinearRecurrence[c,c,300]],PrimeQ] (* Harvey P. Dale, Nov 30 2019 *)

A253706 Primes in the 8th-order Fibonacci numbers A079262.

Original entry on oeis.org

2, 509, 128257, 133294824621464999938178340471931877, 4596852049500861351052672455121859744010232939954169259264638023409631672658340253083284317818242062413
Offset: 1

Views

Author

Robert Price, Jan 09 2015

Keywords

Comments

a(6) is too large to display here. It has 395 digits and is the 1322nd term in A079262.

Crossrefs

Programs

  • Mathematica
    a={0,0,0,0,0,0,0,1}; step=8; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,sum]]; a=RotateLeft[a]; a[[step]]=sum]; lst
  • PARI
    lista(nn) = {gf = x^7/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8); for (n=0, nn, if (isprime(p=polcoeff(gf+O(x^(n+1)), n)), print1(p, ", ")););} \\ Michel Marcus, Jan 12 2015

A255529 Indices of primes in the 9th-order Fibonacci number sequence, A104144.

Original entry on oeis.org

10, 19, 878
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(4) > 2*10^5.

Crossrefs

Programs

  • Mathematica
    a={0,0,0,0,0,0,0,0,1}; step=9; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
  • PARI
    a104144(n) = polcoeff(x^8/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9) + O(x^(n+1)), n);
    lista(nn) = {for (n=1, nn, if (isprime(a104144(n)), print1(n, ", ")););} \\ Michel Marcus, Feb 27 2015

A255530 Indices of primes in the 9th-order Fibonacci number sequence, A251746.

Original entry on oeis.org

10, 19, 59, 79, 12487
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(6) > 2*10^5.

Crossrefs

Programs

  • Mathematica
    a={0,0,0,0,0,0,0,1,0}; step=9; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst

A255531 Indices of primes in the 9th-order Fibonacci number sequence, A251747.

Original entry on oeis.org

10, 16, 116, 236, 316, 1376, 5066, 103696, 120949
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(10) > 2*10^5.

Crossrefs

Programs

  • Mathematica
    a={0,0,0,0,0,0,1,0,0}; step=9; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
    Flatten[Position[LinearRecurrence[Table[1,{9}],{0,0,0,0,0,0,1,0,0},125000],?PrimeQ]]-1 (* _Harvey P. Dale, Nov 29 2017 *)
Previous Showing 31-40 of 56 results. Next