login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125675 a(1)=1; for n>1, a(n) = the (a(n-1)(mod n)+1)-st integer from among those positive integers which do not occur earlier in the sequence. 1
1, 3, 2, 6, 5, 11, 10, 8, 17, 16, 14, 9, 22, 21, 19, 13, 30, 29, 27, 24, 15, 37, 36, 34, 31, 23, 50, 49, 47, 44, 40, 32, 65, 64, 62, 59, 55, 48, 35, 75, 74, 72, 69, 63, 53, 28, 73, 68, 57, 33, 84, 83, 81, 78, 70, 51, 108, 107, 105, 102, 98, 93, 87, 76, 43, 109, 106, 100, 91, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Paul Tek, Table of n, a(n) for n = 1..10000

MATHEMATICA

f[l_List] := Block[{n = Length[l] + 1, k = 0, c = Mod[l[[ -1]], n] + 1}, While[c > 0, k++; While[MemberQ[l, k], k++ ]; c--; ]; Append[l, k]]; Nest[f, {1}, 70] (* Ray Chandler, Feb 08 2007 *)

CROSSREFS

Sequence in context: A085179 A113782 A090868 * A301501 A072787 A293549

Adjacent sequences:  A125672 A125673 A125674 * A125676 A125677 A125678

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Jan 30 2007

EXTENSIONS

Extended by Ray Chandler, Feb 08 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 23:37 EST 2020. Contains 330995 sequences. (Running on oeis4.)