This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A152592 #11 Apr 18 2024 12:50:25
%S A152592 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,
%T A152592 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,
%U A152592 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
%N 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.
%H A152592 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,-1,1).
%F A152592 From _Chai Wah Wu_, Apr 18 2024: (Start)
%F A152592 a(n) = a(n-1) - a(n-5) + a(n-6) for n > 25.
%F A152592 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)
%Y A152592 See A059437 for another version.
%K A152592 nonn,word,easy,less
%O A152592 0,1
%A A152592 _Paul Curtz_, Dec 09 2008
%E A152592 Edited by _N. J. A. Sloane_, Apr 09 2009, Apr 11 2009
%E A152592 Extended by _Nathaniel Johnston_, May 05 2011