|
Search: id:A135508
|
|
|
| A135508 |
|
a(n)=x(n+1)/x(n)-2 where x(1)=1 and x(n)=2*x(n-1)+lcm(x(n-1),n). |
|
+0
1
|
|
| 2, 3, 1, 1, 1, 7, 2, 1, 1, 11, 1, 1, 7, 1, 1, 17, 1, 1, 1, 7, 11, 23, 1, 1, 1, 1, 7, 29, 1, 1, 2, 11, 17, 7, 1, 37, 1, 1, 1, 41, 7, 1, 11, 1, 23, 47, 1, 1, 1, 17, 1, 53, 1, 1, 1, 1, 29, 59, 1, 1, 1, 1, 1, 1, 1, 67, 17, 1, 1, 71, 1, 1, 37, 1, 1, 1, 1, 79, 1, 1, 41, 83, 1, 1, 1, 29, 1, 89, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This sequence has fascinating properties related to primes and especially to twin primes. For instance sequence consists of 1's or primes only. 2 occurs infinitely many times, largest primes in twin pairs never occur, other primes occur finitely many times...
|
|
REFERENCES
|
Benoit Cloitre, Beyond Rowland's gcd sequence, in preparation, 2008
|
|
FORMULA
|
a(2*4^k)=2 k>=0
|
|
PROGRAM
|
(PARI) x1=1; for(n=2, 40, x2=2*x1+lcm(x1, n); t=x1; x1=x2; print1(x2/t-2, ", "))
|
|
CROSSREFS
|
Cf. A106108.
Sequence in context: A108756 A106178 A108714 this_sequence A030413 A139434 A113925
Adjacent sequences: A135505 A135506 A135507 this_sequence A135509 A135510 A135511
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 09 2008
|
|
|
Search completed in 0.002 seconds
|
