|
Search: id:A034276
|
|
|
| A034276 |
|
Smallest prime that generates a prime pyramid of height n. |
|
+0
4
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Let p be prime; look for smallest prime that has previous term as a centered substring and has 2 more digits; repeat until no such prime can be found; then height(p) = number of rows in pyramid.
|
|
LINKS
|
H. Heinz, Patterns in Primes, Illustrating Two Prime Pyramids
|
|
EXAMPLE
|
Example for p=43: 43 3433 334333 93343339 3933433393 939334333939 39393343339393, stop; height(43)=7.
|
|
CROSSREFS
|
Cf. A047076, A053600, A052205, A046210, A052091, A052092.
Sequence in context: A140677 A018944 A061086 this_sequence A072711 A005110 A059337
Adjacent sequences: A034273 A034274 A034275 this_sequence A034277 A034278 A034279
|
|
KEYWORD
|
nonn,nice,base
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Jan 25 2000
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jul 14 2001
|
|
|
Search completed in 0.002 seconds
|
