A160546 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A160546

Not divisible by 29.

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

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

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

FORMULA

From Chai Wah Wu, Aug 04 2016: (Start)

a(n) = a(n-1) + a(n-28) - a(n-29) for n > 29.

G.f.: Sum_{k = 1..29} x^k /(1 - x - x^28 + x^29). (End)

MATHEMATICA

With[{nn=100}, Complement[Range[nn], Range[29, nn, 29]]] (* Harvey P. Dale, Mar 11 2013 *)

PROG

(Sage) [i for i in range(0, 100) if gcd(29, i) == 1]

CROSSREFS

Sequence in context: A153679 A273887 A194906 * A356944 A087143 A080683

Adjacent sequences: A160543 A160544 A160545 * A160547 A160548 A160549

KEYWORD

nonn,easy

AUTHOR

Zerinvary Lajos, May 18 2009

STATUS

approved