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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113963 a(1)=1; for n>1, a(n) is the smallest positive integer not occurring earlier in the sequence where |a(n)-a(n-1)| does not divide (a(n)+a(n-1)). 3
1, 4, 7, 2, 5, 8, 3, 10, 13, 6, 11, 14, 9, 16, 19, 12, 17, 20, 23, 15, 22, 25, 18, 26, 21, 29, 24, 31, 27, 32, 35, 38, 28, 33, 37, 30, 39, 34, 40, 43, 36, 41, 44, 47, 42, 50, 53, 45, 49, 46, 51, 55, 48, 57, 52, 58, 61, 54, 59, 56, 62, 65, 68, 63, 67, 60, 69, 64, 70, 73, 66, 71 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Sequence is a permutation of the positive integers.

EXAMPLE

Among those positive integers not among the first 4 integers of the sequence, a(5) = 5 is the lowest such that |a(5)-a(4)| = |5-2| = 3 does not divide (a(5)+a(4)) = 5+2 = 7. 3, for example, is not among the first 4 terms of the sequence, but |3-2| = 1 does indeed divide (3+2). So a(5) is not 3, but is instead 5.

MATHEMATICA

f[l_] := Block[{k=1, m}, m = Last[l]; While[MemberQ[l, k] || Mod[m + k, Abs[k - m]] == 0, k++ ]; Return[Append[l, k]]; ]; Nest[f, {1}, 100] (*Chandler*)

CROSSREFS

Cf. A113964, A113965, A113966.

Sequence in context: A130882 A164106 A159895 * A071932 A139348 A021683

Adjacent sequences:  A113960 A113961 A113962 * A113964 A113965 A113966

KEYWORD

nonn

AUTHOR

Leroy Quet Nov 10 2005

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 13 2005

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 16:00 EST 2012. Contains 205938 sequences.