login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062039 a(0) = 1; a(n+1) = a(n) - n if a(n) > n, otherwise a(n+1) = a(n) + a(a(n)). 12

%I #19 Aug 03 2014 16:52:44

%S 1,1,2,4,1,2,4,5,7,12,3,7,12,24,11,18,3,7,12,24,5,7,12,24,1,2,4,5,7,

%T 12,24,25,27,32,59,25,27,32,59,21,28,35,60,18,30,54,9,21,28,35,60,10,

%U 13,37,69,15,33,65,8,15,33,65,4,5,7,12,24,25,27,32,59,74,3,7,12,24,25,27

%N a(0) = 1; a(n+1) = a(n) - n if a(n) > n, otherwise a(n+1) = a(n) + a(a(n)).

%C a(A193854(n)) = 1, n>0;

%C A123643 and A123644 give record values and their positions: A123643(n)=a(A123644(n)). - _Reinhard Zumkeller_, Oct 04 2006

%H R. Zumkeller, <a href="/A062039/b062039.txt">Table of n, a(n) for n = 0..10000</a>

%t a[0] = 1; a[n_] := a[n] = If[a[n-1] > n-1, a[n-1] - (n-1), a[n-1] + a[a[n-1]]]; Table[a[n], {n, 0, 77}] (* _Jean-François Alcover_, Mar 20 2011 *)

%o (Haskell)

%o a062039 n = a062039_list !! n

%o a062039_list = 1 : f 1 0 where

%o f x n | x > n = (x-n) : f (x-n) (n+1)

%o | otherwise = x' : f x' (n+1) where x' = x + a062039 x

%o -- _Reinhard Zumkeller_, Aug 10 2011

%Y A123643 and A123644 give record values and their positions: A123643(n)=a(A123644(n)).

%Y Cf. A193926 (first differences), A193927.

%K easy,nice,nonn

%O 0,3

%A _Reinhard Zumkeller_, Jul 12 2001

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)