|
Search: id:A145103
|
|
|
| A145103 |
|
a(0) = a(1) = 1. a(n+1) = ceiling(n*a(n)/a(n-1)), for n>=1. |
|
+0
2
|
|
| 1, 1, 1, 2, 6, 12, 10, 5, 4, 7, 16, 23, 16, 9, 8, 13, 25, 31, 22, 13, 12, 19, 34, 40, 28, 17, 16, 25, 43, 49, 34, 21, 20, 31, 52, 58, 40, 25, 24, 37, 61, 66, 45, 29, 28, 43, 70, 75, 51, 33, 32, 49, 79, 84, 57, 37, 36, 55, 88, 93, 63, 41, 40, 61, 97, 102, 69, 45, 44, 67, 106, 111
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
PROGRAM
|
(PARI) {print1(a=1, ", ", b=1, ", "); for(n=2, 71, print1(c=ceil((n-1)*b/a), ", "); a=b; b=c)} [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 02 2008]
|
|
CROSSREFS
|
A145102
Sequence in context: A105692 A107647 A145102 this_sequence A009230 A069491 A127698
Adjacent sequences: A145100 A145101 A145102 this_sequence A145104 A145105 A145106
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Oct 01 2008
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and R. J. Mathar (mathar(AT)strw.leidenuniv.nl) Oct 02 2008
|
|
|
Search completed in 0.002 seconds
|
