login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006162 a(n)=a(a(n-1)-2)+a(n+2-a(n-1)).
(Formerly M0450)
0
1, 1, 2, 3, 4, 4, 5, 6, 7, 8, 8, 8, 9, 10, 11, 12, 13, 13, 14, 14, 15, 16, 17, 18, 19, 20, 20, 21, 22, 22, 22, 22, 23, 24, 25, 26, 27, 28, 29, 29, 30, 31, 32, 32, 33, 33, 34, 34, 35, 36, 37, 38, 39, 40, 41 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

J. Arkin, D. C. Arney, L. S. Dewald and W. E. Ebel, Jr., Families of recursive sequences, J. Rec. Math., 22 (No. 22, 1990), 85-94.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..55.

CROSSREFS

Sequence in context: A245335 A244230 A277814 * A036701 A053756 A210436

Adjacent sequences:  A006159 A006160 A006161 * A006163 A006164 A006165

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 05:36 EST 2019. Contains 329978 sequences. (Running on oeis4.)