login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175408 a(n) + a(n - 1) is alternatively a cube or a square. 0
1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 1, 7, 2, 6, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(1)=1, then a(2n) = (the least cube > a(2n-1)) - a(2n-1), and

a(2n+1) = (the least square > a(2n)) - a(2n).

Period of length 10: {7,2,6,3,5,4,4,5,3,1}.

LINKS

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

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

FORMULA

a(1)=1, afterwards a(n)=A130532(n+7).

a(n)=(1/90)*{26*[(n-1) mod 10]+26*(n mod 10)-[(n+1) mod 10]+8*[(n+2) mod 10]+17*[(n+3) mod 10]-10*[(n+4) mod 10]+35*[(n+5) mod 10]-28*[(n+6) mod 10]+53*[(n+7) mod 10]-46*[(n+8) mod 10]}, with n>=0 [From Paolo P. Lava, May 04 2010]

CROSSREFS

Cf. A130532.

Sequence in context: A128475 A309647 A225444 * A019934 A295874 A182548

Adjacent sequences:  A175405 A175406 A175407 * A175409 A175410 A175411

KEYWORD

nonn

AUTHOR

Zak Seidov, May 03 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 10:34 EDT 2020. Contains 337289 sequences. (Running on oeis4.)