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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109849 a(1) = 1 a(2) = 2, a(n) = LCM of n and a(n-2), a(n+1)= LCM of (n+1) and a(n-3) and so on until a(2n-1) = LCM of (2n-1) and a(1). Then a(2n) = LCM of 2n and a(2n-2) and so on. 1
1, 2, 3, 4, 5, 12, 21, 8, 9, 40, 231, 12, 65, 28, 15, 16, 17, 144, 285, 140, 1365, 132, 5313, 120, 225, 104, 189, 84, 145, 60, 93, 32, 33, 544, 3255, 180, 5365, 1596, 2457, 520, 9225, 840, 228459, 132, 4095, 3220, 13395, 144, 833, 400, 255, 364, 3445, 108, 1155 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Another bootstrap sequence. 12 appears twice.

12 60 65 104 120 132 144 252 255 400 912 1008 1020 1980 2112 2457 4092 4095 ... are the smallest numbers that appear twice, with 4095 being the smallest number that appears three times. - Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 04 2006

CROSSREFS

Cf. A109850.

Sequence in context: A057472 A117577 A069469 * A007662 A175807 A165303

Adjacent sequences:  A109846 A109847 A109848 * A109850 A109851 A109852

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 06 2005

EXTENSIONS

More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 04 2006

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 14 18:05 EST 2012. Contains 205664 sequences.