|
Search: id:A135507
|
|
|
| A135507 |
|
a(1)=1; for n>1, a(n)=2*a(n-1)+lcm(a(n-1),n). |
|
+0
1
|
|
| 1, 4, 20, 60, 180, 540, 4860, 19440, 58320, 174960, 2274480, 6823440, 20470320, 184232880, 552698640, 1658095920, 31503822480, 94511467440, 283534402320, 850603206960, 7655428862640, 99520575214320, 2488014380358000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This sequence has fascinating properties related to primes and especially to twin primes. For instance a(n+1)/a(n)-2 is never the largest prime of a twin pair (except for 7).
|
|
REFERENCES
|
Benoit Cloitre, Beyond Rowland's gcd sequence, in preparation, 2008
|
|
PROGRAM
|
(PARI) x1=1; for(n=2, 40, x2=2*x1+lcm(x1, n); t=x1; x1=x2; print1(x2, ", "))
|
|
CROSSREFS
|
Cf. A106108.
Sequence in context: A066970 A033488 A018211 this_sequence A131479 A055538 A123613
Adjacent sequences: A135504 A135505 A135506 this_sequence A135508 A135509 A135510
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 09 2008, Feb 10 2008
|
|
|
Search completed in 0.002 seconds
|
