|
Search: id:A152466
|
|
|
| A152466 |
|
a(1) = 252, a(n) is a(n-1) multiplied by the smallest prime factor of a(n-1)+1. |
|
+0
1
|
|
| 252, 2772, 130284, 651420, 219528540, 257067920340, 4370154645780, 292800361267260, 11023640801351071740, 13475008472558425746927448860, 5107028211099643358085503117940, 1313771981231475489737485570488833367540
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Conjecture: this sequence will never have any numbers k where k+1 is prime. (All similar sequences that start with numbers less than 252 are known to have numbers k where k+1 is prime.)
|
|
EXAMPLE
|
First term is 252. Smallest prime factor of 253 is 11, so next term is 252 * 11 = 2772.
|
|
MATHEMATICA
|
a = {252}; Do[AppendTo[a, a[[ -1]]*FactorInteger[a[[ -1]] + 1][[1, 1]]], {10}]; a [From Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 06 2008]
|
|
CROSSREFS
|
Sequence in context: A166783 A104679 A117281 this_sequence A004535 A027815 A099059
Adjacent sequences: A152463 A152464 A152465 this_sequence A152467 A152468 A152469
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
J. Lowell (jhbubby(AT)mindspring.com), Dec 05 2008
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 06 2008
Extended by Max Alekseyev (maxale(AT)gmail.com), Sep 19 2009
|
|
|
Search completed in 0.002 seconds
|
