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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124833 A055932(n) divided by product of all primes less than the greatest prime factor of A055932(n). 1
1, 2, 4, 3, 8, 6, 16, 9, 12, 5, 32, 18, 24, 27, 10, 64, 36, 15, 48, 54, 20, 128, 72, 25, 81, 30, 96, 7, 108, 40, 256, 45, 144, 50, 162, 60, 192, 14, 216, 75, 80, 243, 512, 90, 288, 100, 21, 324, 120, 125, 384, 135, 28, 432, 150, 160, 486, 1024, 35, 180, 576, 200, 42, 648 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Shifted right, this is a permutation of the positive integers.

FORMULA

a(n) = A055932(n) / A034386(A006530(A055932(n))-1). If A055932(n) = Product_{i=1}^k Prime(k)^e_k (with the e_i's all nonzero), then a(n) = (Product_{i=1}^{k-1} Prime(k)^{e_k-1}) * Prime(k)^e_k.

CROSSREFS

Cf. A055932, A034386, A006530.

Sequence in context: A127301 A122111 A153212 * A181815 A168521 A101468

Adjacent sequences:  A124830 A124831 A124832 * A124834 A124835 A124836

KEYWORD

nonn

AUTHOR

Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Nov 09 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 16 04:47 EST 2012. Contains 205860 sequences.