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

%I #5 Mar 30 2012 19:00:22

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

%T 10,10,11,11,12,12,13,14,14,14,14,15,16,16,16,16,16,16,16,16

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

%C Hofstadter-Conway-like sequence (see A004001). Conjecture 1: a(n) - a(n-1) = 0 or 1. Conjecture 2: lim n ->infinity a(n)/n = 1/3.

%H Paolo P. Lava, <a href="/A171482/b171482.txt">Table of n, a(n) for n = 0..10000</a>

%K nonn

%O 0,4

%A _Jaroslav Krizek_, Dec 09 2009

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