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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110658 a(n) = A028242(A028242(A028242(n))). 4
1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 4, 3, 2, 4, 3, 2, 4, 3, 5, 4, 3, 5, 4, 3, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 7, 6, 5, 7, 6, 5, 7, 6, 8, 7, 6, 8, 7, 6, 8, 7, 9, 8, 7, 9, 8, 7, 9, 8, 10, 9, 8, 10, 9, 8, 10, 9, 11, 10, 9, 11, 10, 9, 11, 10, 12, 11, 10, 12, 11, 10, 12, 11, 13, 12, 11, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,1,-1)

FORMULA

a(n) = A028242(A110657(n)) = A110657(A028242(n)).

a(n) = floor(n/8) + (4 - (n mod 8) mod 3) mod 3.

G.f.: (x^2-x+1)*(x^6-2*x^4+x^2+1) / ((x-1)^2*(x+1)*(x^2+1)*(x^4+1)). - Colin Barker, Apr 01 2013

MATHEMATICA

A028242[n_] := (1 + 2*n + 3*(-1)^n)/4; Table[A028242[A028242[ A028242[n] ]], {n, 0, 50}] (* G. C. Greubel, Sep 03 2017 *)

CROSSREFS

Cf. A110656.

Sequence in context: A127788 A025656 A194517 * A002188 A128313 A283486

Adjacent sequences:  A110655 A110656 A110657 * A110659 A110660 A110661

KEYWORD

nonn,easy

AUTHOR

Reinhard Zumkeller, Aug 05 2005

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 July 15 20:24 EDT 2019. Contains 325056 sequences. (Running on oeis4.)