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!)
A171481 a(n) = a(a(n-1)) + a(n - a(n-1) - 2) with a(0) = 0, a(1) = a(2) = 1. 1
0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12, 13, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 19, 19, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
Conjecture 1: a(n) - a(n-1) = 0 or 1.
Conjecture 2: lim_{n->infinity} a(n)/n = e/10.
LINKS
MAPLE
A171481 := proc(n) option remember; if n = 0 then 0; elif n <=2 then 1; else procname(procname(n-1)) +procname(n-procname(n-1)-2) ; end if; end proc: seq(A171481(n), n=0..100) ; # R. J. Mathar, Mar 16 2010
CROSSREFS
Hofstadter-Conway-like sequence (see A004001).
Sequence in context: A367194 A135297 A176146 * A230775 A108037 A237354
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Dec 09 2009
EXTENSIONS
More terms from R. J. Mathar, Mar 16 2010
STATUS
approved

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