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 41 results. Next

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.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232543, A214899, A020992, A233554, A214727, A234696, A141523, A235862, A214825, A235873, A001630, A241660, A247027, A000288, A247561, A000322, A248920.

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

Cf. A001590, A001631, A100683, A231574, A231575, A232543, A214899, A020992, A233554, A214727, A234696, A141523, A235862, A214825, A235873, A001630, A241660, A247027, A000288, A247561, A000322, A248920, A000383, A247192, A060455, A253318, A079262, A253705.

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.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A104144.

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.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251746.

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.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251747.

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

A255532 Indices of primes in the 9th-order Fibonacci number sequence, A251749.

Original entry on oeis.org

10, 14, 19, 29, 404, 1744, 8854, 27754
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(9) > 2*10^5.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251749.

Programs

  • Mathematica
    a={0,0,0,0,1,0,0,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

A255533 Indices of primes in the 9th-order Fibonacci number sequence, A251750.

Original entry on oeis.org

10, 33, 43, 253, 1253, 2389
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(7) > 2*10^5.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251750.

Programs

  • Mathematica
    a={0,0,0,1,0,0,0,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

A255534 Indices of primes in the 9th-order Fibonacci number sequence, A251751.

Original entry on oeis.org

10, 12, 232, 502
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(5) > 2*10^5.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251751.

Programs

  • Mathematica
    a={0,0,1,0,0,0,0,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,1,0,0,0,0,0,0},510], ?(PrimeQ[#]&)]]-1 (* _Harvey P. Dale, Feb 27 2016 *)

A255536 Indices of primes in the 9th-order Fibonacci number sequence, A251752.

Original entry on oeis.org

10, 11, 21, 29, 301, 57089
Offset: 1

Views

Author

Robert Price, Feb 24 2015

Keywords

Comments

a(7) > 2*10^5.

Links

Crossrefs

Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251752.

Programs

  • Mathematica
    a={0,1,0,0,0,0,0,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

A093175 Tetranacci numbers starting with first four squares.

Original entry on oeis.org

1, 4, 9, 16, 30, 59, 114, 219, 422, 814, 1569, 3024, 5829, 11236, 21658, 41747, 80470, 155111, 298986, 576314, 1110881, 2141292, 4127473, 7955960, 15335606, 29560331, 56979370, 109831267, 211706574, 408077542, 786594753, 1516210136, 2922589005
Offset: 1

Views

Author

Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), May 11 2004

Keywords

Links

Crossrefs

Cf. A086192.

Programs

  • Mathematica
    a[1] = 1; a[2] = 4; a[3] = 9; a[4] = 16; a[n_] := a[n] = a[n - 1] + a[n - 2] + a[n - 3] + a[n - 4]; Table[ a[n], {n, 33}] (* Robert G. Wilson v *)
LinearRecurrence[{1,1,1,1},Range[4]^2,40] (* Harvey P. Dale, Oct 16 2012 *)

Formula

a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4).
G.f.: -x*(1+x)*(2*x^2+2*x+1)/(-1+x+x^2+x^3+x^4). a(n)=2*A000078(n+3)+2*A000078(n)-A001631(n+1). [R. J. Mathar, Apr 20 2009]

Extensions

More terms from Robert G. Wilson v and Labos Elemer, May 12 2004, May 11 2004
Previous Showing 31-40 of 41 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.