A152592 Consider the last letter of each of the English words zero, one, two, three, four, five, ... . Write down 0 for a vowel {a,e,i,o,u}, 1 for a consonant.

0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1

Offset

0,1

Links

Table of n, a(n) for n=0..104.

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

Formula

From Chai Wah Wu, Apr 18 2024: (Start)

a(n) = a(n-1) - a(n-5) + a(n-6) for n > 25.

G.f.: x^4*(x^21 - x^20 + x^17 - x^14 + x^13 - x^11 + x^10 - x^9 + x^8 - x^7 - x^2 + x - 1)/(x^6 - x^5 + x - 1). (End)

Crossrefs

See A059437 for another version.

Sequence in context: A011665 A347411 A059437 * A347412 A275926 A131533

Adjacent sequences: A152589 A152590 A152591 * A152593 A152594 A152595

Keyword

nonn,word,easy,less

Author

Paul Curtz, Dec 09 2008

Extensions

Edited by N. J. A. Sloane, Apr 09 2009, Apr 11 2009

Extended by Nathaniel Johnston, May 05 2011

Status

approved