|
Search: id:A118909
|
|
|
| A118909 |
|
a(1) = 4; a(n) is least semiprime > a(n-1)^2. |
|
+0
2
|
|
| 4, 21, 445, 198026, 39214296677, 1537761063871773242347, 2364709089560047865452947255794201194068433, 5591849078247910476736920566826713466552016538943524658263883555662554776622687075541
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Semiprime analogue of A055496 a(1) = 2; a(n) is smallest prime > 2*a(n-1). See also A059785 a(n+1)=prevprime(a(n)^2), with a(1) = 2. With that, of course, there's always a prime between n and 2n, so a(n) < 2^n. The obverse of this is A118908 a(1) = 4; a(n) is greatest semiprime < a(n-1)^2.
|
|
EXAMPLE
|
a(8) = a(7)^2 + 52, and there is no smaller k such that a(7)^2 + k is semiprime.
|
|
CROSSREFS
|
Cf. A001358, A055496, A076656, A006992, A005384, A005385, A118908-A118913.
Sequence in context: A006822 A126458 A048164 this_sequence A000868 A000875 A094046
Adjacent sequences: A118906 A118907 A118908 this_sequence A118910 A118911 A118912
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), May 05 2006
|
|
|
Search completed in 0.002 seconds
|
