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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126917 a(1)=1. a(n) = the (largest proper divisor of n)th integer from among those positive integers not occurring earlier in the sequence. 1
1, 2, 3, 5, 4, 8, 6, 11, 10, 14, 7, 17, 9, 20, 18, 23, 12, 26, 13, 29, 25, 32, 15, 35, 24, 38, 33, 41, 16, 44, 19, 47, 40, 50, 34, 53, 21, 56, 48, 59, 22, 62, 27, 65, 55, 68, 28, 71, 43, 74, 63, 77, 30, 80, 54, 83, 70, 86, 31, 89, 36, 92, 78, 95, 64, 98, 37, 101, 85, 104, 39 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Sequence is a permutation of the positive integers.

EXAMPLE

The largest proper divisor of 8 is 4. So a(8) is the 4th integer from among those not occurring among the first 7 integers of the sequence (a(8) is the 4th integer from among 7,9,10,11,13,14,..). So a(8) = 11.

MATHEMATICA

f[l_List] := Block[{k = 0, c = Divisors[Length[l] + 1][[ -2]]}, While[c > 0, k++; While[MemberQ[l, k], k++ ]; c--; ]; Append[l, k]]; Nest[f, {1}, 71] (*Chandler*)

CROSSREFS

Cf. A126918, A032742.

Sequence in context: A089557 A083464 A065561 * A086496 A102398 A118317

Adjacent sequences:  A126914 A126915 A126916 * A126918 A126919 A126920

KEYWORD

nonn

AUTHOR

Leroy Quet Dec 31 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 04 2007

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 20:01 EST 2012. Contains 205955 sequences.