|
|
A034276
|
|
Smallest prime that generates a prime pyramid of height n.
|
|
3
|
|
|
11, 29, 2, 5, 41, 251, 43, 145577, 51941, 4372877, 26901631, 366636187, 15387286403, 218761753811, 3313980408469
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Let p be prime; look for the smallest prime in {1|p|1, 3|p|3, 7|p|7, 9|p|9}, where '|' stands for concatenation; repeat until no such prime can be found; then height(p) = number of rows in pyramid.
|
|
LINKS
|
|
|
EXAMPLE
|
Example for p=43: 43 3433 334333 93343339 3933433393 939334333939 39393343339393, stop; height(43)=7.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|