This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057165 Addition steps in Recamán's sequence A005132. 9

%I

%S 1,2,3,5,6,7,9,11,13,15,17,18,19,21,24,26,28,30,32,33,34,36,39,41,43,

%T 45,47,49,51,53,55,57,59,61,63,65,66,67,69,71,73,75,78,80,82,84,86,88,

%U 90,92,94,96,98,100,101,102,104,106,108,112,113,114

%N Addition steps in Recamán's sequence A005132.

%H Reinhard Zumkeller, <a href="/A057165/b057165.txt">Table of n, a(n) for n = 1..10000</a>

%H Nick Hobson, <a href="/A057165/a057165.py.txt">Python program for this sequence</a>

%H C. L. Mallows, <a href="/A005132/a005132.jpg">Plot (jpeg) of first 10000 terms of A005132</a>

%H C. L. Mallows, <a href="/A005132/a005132.ps">Plot (postscript) of first 10000 terms of A005132</a>

%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>

%o import Data.Set (Set, singleton, notMember, insert)

%o a057165 n = a057165_list !! n

%o a057165_list = r (singleton 0) 1 0 where

%o r :: Set Integer -> Integer -> Integer -> [Integer]

%o r s n x = if x > n && (x - n) `notMember` s

%o then r (insert (x-n) s) (n+1) (x-n)

%o else n : r (insert (x+n) s) (n+1) (x+n)

%o -- _Reinhard Zumkeller_, Mar 17 2011

%Y Cf. A005132, A057166, A057167.

%Y Union of A187921 and A187922.

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Sep 14 2000

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

Last modified November 14 03:52 EST 2018. Contains 317159 sequences. (Running on oeis4.)