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!)
A158938 Numbers congruent to {-3,7,9,11,13,23,25,27} mod 64. 1
-3, 7, 9, 11, 13, 23, 25, 27, 61, 71, 73, 75, 77, 87, 89, 91, 125, 135, 137, 139, 141, 151, 153, 155, 189, 199, 201, 203, 205, 215, 217, 219, 253, 263, 265, 267, 269, 279, 281, 283, 317, 327, 329, 331, 333, 343, 345, 347, 381, 391, 393, 395, 397, 407, 409, 411 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

When will this first differ from A103621?

LINKS

Colin Barker, 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) = a(n-8) + 64.

From Colin Barker, Oct 14 2019: (Start)

G.f.: -(3 - 10*x - 2*x^2 - 2*x^3 - 2*x^4 - 10*x^5 - 2*x^6 - 2*x^7 - 37*x^8) / ((1 - x)^2*(1 + x)*(1 + x^2)*(1 + x^4)).

a(n) = a(n-1) + a(n-8) - a(n-9) for n>8.

(End)

CROSSREFS

Cf. A103621.

Sequence in context: A222262 A027897 A027892 * A047529 A125667 A072939

Adjacent sequences:  A158935 A158936 A158937 * A158939 A158940 A158941

KEYWORD

sign,easy

AUTHOR

Philippe Deléham, Mar 31 2009

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 12 12:50 EST 2019. Contains 329958 sequences. (Running on oeis4.)