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!)
A087826 a(n) = a(n-a(n-1)) + a(a(n-a(n-2))). 0

%I #20 Jan 01 2024 11:20:05

%S 1,1,2,2,3,3,3,5,4,5,5,5,8,5,7,7,8,8,8,8,13,7,10,10,10,10,13,12,11,13,

%T 13,13,13,21,8,15,12,15,18,12,16,18,18,15,21,18,16,21,20,18,21,26,21,

%U 18,25,20,20,22,20,19,25,20,25,25,17,27,20,28,24,26,28,23,31,31,22,31,28

%N a(n) = a(n-a(n-1)) + a(a(n-a(n-2))).

%o (True BASIC)

%o 70 DIM q0(0 to 4000)

%o 80 LET q0(1)=1

%o 90 LET q0(2)=1

%o 91 FOR n = 3 to 4000

%o 92 LET q0(n)=q0(n-q0(n-1))+q0(q0(n-q0(n-2)))

%o 93 NEXT n

%o 100 SET MODE "color"

%o 110 SET WINDOW 0,1024,0,750

%o 302 PRINT" by Roger L. Bagula Oct 06 2003 "

%o 381 open #1: name "CM1:Ht3_data",create newold, org text

%o 390 FOR x=1 to 200

%o 391 PRINT #1: q0(x);",";

%o 392 NEXT x

%o 393 close #1

%o 460 END

%Y Cf. A081831.

%K nonn

%O 1,3

%A _Roger L. Bagula_, Oct 06 2003

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 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)