Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053341
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053341 Euclid-Pocklington primes: primes of the form p[1]*p[2]*...*p[k]*p[k+1]^m + 1 where p[r] = r-th prime and p[1]*p[2]*...*p[k] < p[k+1]^m. +0
1
3, 5, 7, 17, 19, 151, 163, 257, 487, 751, 1459, 1471, 39367, 65537, 72031, 279511, 33820711, 86093443, 258280327, 372027811, 4092305911, 11149928791, 42638305711, 209481995953231, 411782264189299, 3561193931204911 (list; graph; listen)
OFFSET

1,1

LINKS

Donovan Johnson (donovan.johnson(AT)yahoo.com), Table of n, a(n) for n = 1..454

EXAMPLE

5 = 2^2+1 is of this form (with k=0).

CROSSREFS

Sequence in context: A125739 A122853 A137258 this_sequence A086086 A141772 A032496

Adjacent sequences: A053338 A053339 A053340 this_sequence A053342 A053343 A053344

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 05 2000

EXTENSIONS

More terms from Jud McCranie (j.mccranie(AT)comcast.net), Jul 11 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.


AT&T Labs Research