|
Search: id:A102082
|
|
|
| A102082 |
|
Number of times the n-th letter in an infinately repeating English alphabet appears in the English word for the number n. |
|
+0
1
|
|
| 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,20
|
|
|
EXAMPLE
|
a(5) = f i v e = 1 (letter 5 = e, which appears once in "five")
a(20) = t w e n t y = 2
a(34) = t h i r t y f o u r = 1 (letter 34 = letter 8 = h)
a,b,c,...z,a,b
1,2,3,...26,27,28
|
|
CROSSREFS
|
Sequence in context: A126030 A111373 A116376 this_sequence A030199 A005089 A119395
Adjacent sequences: A102079 A102080 A102081 this_sequence A102083 A102084 A102085
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
Jeremy Ballard (gtg056b(AT)prism.gatech.edu), Feb 13 2005
|
|
|
Search completed in 0.002 seconds
|
