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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160673 a(n)=smallest n-digit prime formed by appending a digit to a(n-1); a(7)=8402963. 1
 8402963, 84029633, 840296333, 8402963339, 84029633399, 840296333999, 8402963339993, 84029633399939, 840296333999393, 8402963339993933 (list; graph; refs; listen; history; text; internal format)
 OFFSET 7,1 LINKS Table of n, a(n) for n=7..16. MAPLE A160673 := proc(n) if n = 7 then 8402963; else for d from 1 to 9 by 2 do if isprime(10*procname(n-1)+d )then return 10*procname(n-1)+d ; end if; end do: return -1 ; end if; end proc: for n from 7 to 17 do printf("%d, \n", A160673(n)) ; end do: # R. J. Mathar, Oct 15 2011 CROSSREFS Cf. A000040. Sequence in context: A013971 A036101 A283031 * A283032 A049362 A251119 Adjacent sequences: A160670 A160671 A160672 * A160674 A160675 A160676 KEYWORD base,easy,fini,full,nonn,less AUTHOR Vladislav-Stepan Malakhovsky and Juri-Stepan Gerasimov, May 23 2009 EXTENSIONS Corrected by R. J. Mathar, Oct 15 2011 STATUS approved

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.

Last modified September 10 20:46 EDT 2024. Contains 375794 sequences. (Running on oeis4.)