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

%I #17 Aug 04 2019 11:00:26

%S 1,1,2,3,3,3,5,4,5,5,5,8,6,6,8,8,8,8,8,12,9,8,10,11,11,12,12,12,12,12,

%T 12,20,12,10,15,17,16,13,18,16,15,20,17,19,20,20,20,20,20,20,20,32,17,

%U 16,21,24,25,18,18,32,25,20,21,27,25,26,28,28,23,32,28,24,32,32,25,31

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

%H Muniru A Asiru, <a href="/A081831/b081831.txt">Table of n, a(n) for n = 1..10000</a>

%F Conjecture: a(n)/n -> C = 0.2....

%p a:= proc(n) option remember: if n<3 then 1 else procname(procname(n-procname(n-1)))+ procname(n-procname(n-2)) fi end: seq(a(n), n=1..80); # _Muniru A Asiru_, Jun 04 2018

%t a[1]=a[2]=1;a[n_]:=a[n]=a[a[n-a[n-1]]]+a[n-a[n-2]]; Table[a[n],{n,80}] (* _Harvey P. Dale_, Aug 04 2019 *)

%o (GAP) a:=[1,1];; for n in [3..80] do a[n]:=a[a[n-a[n-1]]]+a[n-a[n-2]]; od; a; # _Muniru A Asiru_, Jun 04 2018

%Y Cf. A005185.

%K nonn

%O 1,3

%A _Benoit Cloitre_, Apr 10 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 March 29 09:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)