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!)
A087816 a(n) = a(a(n-1)) + a(n - 1 - a(n-1)) with a(1) = a(2) = 1. 2
1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 5, 6, 7, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 11, 12, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 19, 19, 20, 21, 21, 21, 22, 22, 23, 24, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 32, 32, 32, 32, 32, 32, 33, 33, 33, 33, 33, 34, 34, 34 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
From Peter Bala, Sep 11 2022: (Start)
a(n) = n + 1 - A004001(n+1).
a(n) = A080677(n+1) - 1.
a(n+1) - a(n) = 0 or 1. (End)
MAPLE
A087816 := proc(n) option remember; if n <= 2 then 1 else procname(procname(n-1)) + procname(n - 1 - procname(n-1)); fi; end;
seq(A087816(n), n = 1..100); # Peter Bala, Sep 11 2022
MATHEMATICA
hg[n_Integer?Positive] := hg[n] =hg[hg[n-1]] + hg[n -1- hg[n-1]] hg[1] = hg[2] = 1 digits=2^8 a=Table[hg[n], {n, 1, digits}]
CROSSREFS
Sequence in context: A255072 A029131 A162351 * A072000 A157477 A248801
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Oct 05 2003
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 18 20:10 EDT 2024. Contains 371781 sequences. (Running on oeis4.)