Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068858
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068858 a(1) = 3 = 1*3; a(n) = smallest multiple of a(n-1) which is a product of two consecutive odd numbers. +0
2
3, 15, 195, 4095, 2477475, 448422975, 1744813795725, 6979255182900, 27917020731600, 111668082926400, 446672331705600, 1786689326822400, 7146757307289600, 28587029229158400, 114348116916633600 (list; graph; listen)
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 this_sequence A166359 A003505 A120601

Adjacent sequences: A068855 A068856 A068857 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research