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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068858 a(1) = 3 = 1*3; a(n) = smallest multiple of a(n-1) which is a product of two consecutive odd numbers. 1
3, 15, 195, 4095, 2477475, 448422975, 1744813795725, 6979255182900, 27917020731600, 111668082926400, 446672331705600, 1786689326822400, 7146757307289600, 28587029229158400, 114348116916633600 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

EXAMPLE

195 = 13*15 belongs to this sequence and the smallest multiple of 195 which is a product of two consecutive odd numbers is 4095 = 63*65.

CROSSREFS

Cf. A068857.

Sequence in context: A087614 A063739 A060194 * A166359 A195515 A003505

Adjacent sequences:  A068855 A068856 A068857 * A068859 A068860 A068861

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 12 2002

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 23 2002

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 15 07:12 EST 2012. Contains 205697 sequences.