|
Search: id:A133058
|
|
|
| A133058 |
|
a(n)=a(n-1)/gcd(n,a(n-1)) if gcd(n,a(n-1)) divides a(n-1), else a(n)=a(n-1)+n+1 (gcd denotes greatest common divisor). |
|
+0
2
|
|
| 1, 1, 4, 8, 2, 8, 4, 12, 3, 1, 12, 24, 2, 16, 8, 24, 3, 21, 7, 27, 48, 16, 8, 32, 4, 30, 15, 5, 34, 64, 32, 64, 2, 36, 18, 54, 3, 41, 80, 120, 3, 45, 15, 59, 104, 150, 75, 123, 41, 91, 142, 194, 97, 151, 206, 262, 131, 189, 248, 308, 77, 139, 202, 266, 133, 199, 266, 334, 167
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
For every integer a(0) we have a(2*r+4*t+0)=1, a(2*r+4*t+1)=2*r+4*t+3, a(2*r+4*t+2)=2*(2*r+4*t+3), a(2*r+4*t+3)=2 for some integers r and t>=0. - Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Dec 26 2007
|
|
CROSSREFS
|
Cf. A133579.
Sequence in context: A143530 A090488 A020848 this_sequence A011516 A088609 A163813
Adjacent sequences: A133055 A133056 A133057 this_sequence A133059 A133060 A133061
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Dec 16 2007
|
|
EXTENSIONS
|
More terms from Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Dec 26 2007
|
|
|
Search completed in 0.002 seconds
|
