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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064714 Define q(0)=1, q(1)=1, q(2)=1, q(n)=q(abs(n-q(n-2)))+q(abs(n-q(n-3))) (A063892); then a(0) = 1, a(n)=a(n-1)+2*(q(n)-n/2), n > 0. 0
1, 2, 2, 3, 7, 14, 18, 17, 15, 24, 26, 23, 25, 36, 40, 35, 33, 36, 50, 63, 63, 66, 68, 77, 81, 98, 98, 105, 93, 92, 110, 131, 137, 128, 110, 121, 129, 138, 124, 119, 115, 130, 158, 167, 155, 154, 176, 223, 219, 182, 152, 173, 259, 278, 266, 261, 271, 296, 304, 303 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

MATHEMATICA

a[0] = q[0] = q[1] = q[2] = 1; q[n_] := q[n] = q[Abs[n - q[n - 2]]] + q[Abs[n - q[n - 3]]]; a[n_] := a[n] = a[n - 1] + 2*(q[n] - n/2); Table[a[n], {n, 0, 70} ]

CROSSREFS

Cf. A063892, A064552.

Sequence in context: A109277 A093437 A060357 * A152255 A002848 A032257

Adjacent sequences:  A064711 A064712 A064713 * A064715 A064716 A064717

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 13 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:21 EST 2012. Contains 205777 sequences.