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.

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

Original entry on oeis.org

5, 37, 229, 6373, 30949, 145637, 13514981, 4891490533, 28831638239461, 923485001094508397344997, 1074600728546337044183267557, 385383811277918317317596838657669349
Offset: 1

Views

Author

Cino Hilliard, Nov 20 2003

Keywords

Comments

Sum of reciprocals = 0.2315900030315841482180710713.. Are these primes infinite?

Examples

			2*4^2 + 4 + 1 = 37.
		

Programs

  • PARI
    trajpolyn(n1,k) = { s=0; for(x1=0,n1, y1 = polypn2(k,x1); print1(y1","); s+=1.0/y1; ); print(); print(s) }
    polypn2(n,p) = { x=n; y=1; for(m=1,p, y=y+m*x^m; ); return(y) }