OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
It appears that a(n+5)=a(n)+200. - Robert Israel, Mar 17 2020
EXAMPLE
Together the English words for 1 through 119 contain 40 d's, 218 e's, 56 f's, 22 g's, 64 h's, 100 i's, 4 l's, 144 n's, 62 o's, 64 r's, 44 s's, 150 t's, 32 u's, 36 v's, 22 w's, 22 x's and 80 y's. All counts are even so 119 is in the sequence.
MAPLE
letters:= [$"a".."z"]:
V:= Vector(26):
Res:= NULL: count:= 0:
for n from 1 while count < 100 do
S:= convert(n, english);
V:= V + <seq(StringTools:-CountCharacterOccurrences(S, letters[i]), i=1..26)>;
if andmap(type, V, even) then
count:= count+1; Res:= Res, n;
fi
od:
Res; # Robert Israel, Mar 17 2020
CROSSREFS
KEYWORD
nonn,word
AUTHOR
David W. Wilson, Jan 24 2005
STATUS
approved