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!)
A065544 a(n) is smallest prime > 13*a(n-1), a(1) = 13. 0

%I #2 Mar 30 2012 17:30:37

%S 13,173,2251,29269,380503,4946581,64305559,835972301,10867639987,

%T 141279319843,1836631157971,23876205053627,310390665697169,

%U 4035078654063221,52456022502821891,681928292536684637

%N a(n) is smallest prime > 13*a(n-1), a(1) = 13.

%t NextPrim[n_Integer] := Block[ {k = n + 1}, While[ !PrimeQ[k], k++ ]; Return[k]]; a[1] = 13; a[n_] := NextPrim[ 13*a[n - 1]]; Table[ a[n], {n, 1, 20} ]

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Nov 28 2001

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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)