login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145102 a(0) = a(1) = 1. a(n+1) = floor(n*a(n)/a(n-1)), for n>=1. 1
1, 1, 1, 2, 6, 12, 10, 5, 3, 4, 12, 30, 27, 10, 4, 5, 18, 57, 53, 16, 5, 6, 25, 91, 83, 21, 6, 7, 31, 124, 116, 28, 7, 8, 37, 157, 148, 33, 8, 9, 43, 191, 182, 40, 9, 9, 45, 230, 240, 50, 10, 10, 51, 265, 275, 56, 11, 11, 57, 300, 310, 62, 12, 12, 63, 336, 346, 67, 12, 12, 69, 402 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

PROG

(PARI) {print1(a=1, ", ", b=1, ", "); for(n=2, 71, print1(c=floor((n-1)*b/a), ", "); a=b; b=c)} [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 02 2008]

CROSSREFS

A145103

Sequence in context: A111658 A105692 A107647 * A145103 A009230 A069491

Adjacent sequences:  A145099 A145100 A145101 * A145103 A145104 A145105

KEYWORD

nonn

AUTHOR

Leroy Quet Oct 01 2008

EXTENSIONS

More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de),nd R. J. Mathar (mathar(AT)strw.leidenuniv.nl) Oct 02 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 08:40 EST 2012. Contains 205998 sequences.