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-1 of 1 results.

A088584 Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=3.

Original entry on oeis.org

103, 312088729, 9955641160957, 163142317702973500798039087, 327058383882861814163660125754017, 67973813526967723994124686175157751059, 545249446055539622797498212423248888694512551610580463
Offset: 1

Views

Author

Cino Hilliard, Nov 20 2003

Keywords

Comments

Sum of reciprocals = 0.009708741068395080316898549713.. Are these primes infinite?
The next term (a(8)) has 148 digits. - Harvey P. Dale, Dec 15 2018

Examples

			3*3^3 + 2*3^2 + 3 + 1 = 103.
		

Crossrefs

Programs

  • Mathematica
    Select[Accumulate[Join[{1},Table[n*3^n,{n,200}]]],PrimeQ] (* Harvey P. Dale, Dec 15 2018 *)
  • PARI
    trajpolyp(n1,k) = { s=0; for(x1=0,n1, y1 = polypn2(k,x1); if(isprime(y1),print1(y1","); s+=1.0/y1; ) ); print(); print(s) }
    polypn2(n,p) = { x=n; y=1; for(m=0,p, y=y+m*x^m; ); return(y) }

Extensions

More terms from Harvey P. Dale, Dec 15 2018
Showing 1-1 of 1 results.