login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071067 First highest palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 4. 1

%I #20 Jun 26 2024 21:54:43

%S 2,70207,357020753,9635702075369,33963570207536933,

%T 723396357020753693327,1272339635702075369332721,

%U 97127233963570207536933272179,119712723396357020753693327217911,9011971272339635702075369332721791109,33901197127233963570207536933272179110933

%N First highest palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 4.

%C There are 2 such highest "Palindromic prime pyramid" (beginning with 2) with 26 elements.

%D G. L. Honaker Jr. and C. Caldwell, Palindromic prime pyramids, J. Recreational Mathematics, vol. 30.3, 1999-2000, pp. 169-176.

%D J.-P. Delahaye, "Pour la science", (French edition of Scientific American), Juin 2002, p. 99

%H Sean A. Irvine, <a href="/A071067/b071067.txt">Table of n, a(n) for n = 1..26</a>

%Y Cf. A070927, A070922.

%K fini,full,nonn,base,changed

%O 1,1

%A _Benoit Cloitre_, May 26 2002

%E More terms from _Sean A. Irvine_, Jun 26 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 6 12:17 EDT 2024. Contains 374042 sequences. (Running on oeis4.)