Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100773
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100773 a(1) = 1, a(2) = (2*1)/1 = 2. a(n+1) = (n+1)*a(n) divided by the largest prime divisor of a(n). +0
2
1, 2, 3, 4, 10, 12, 28, 32, 144, 480, 1056, 1152, 4992, 5376, 11520, 36864, 208896, 221184, 1400832, 1474560, 6193152, 19464192, 40697856, 42467328, 353894400, 1840250880, 3822059520, 21403533312, 88671780864, 91729428480, 568722456576 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(6) = 12, a(7) = (7*12)/3 = 28.

CROSSREFS

Cf. A002639.

Adjacent sequences: A100770 A100771 A100772 this_sequence A100774 A100775 A100776

Sequence in context: A134170 A049548 A005456 this_sequence A131120 A115195 A095384

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 28 2004

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 10 2004

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research