|
| |
|
|
A102815
|
|
"False so far" sequence.
|
|
0
| |
|
|
11, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 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, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 11,1
|
|
|
COMMENTS
| The last digit of a(n) is regarded as a glyph and the preceding digits as a number. So "11" reads [one "1"] and "20" [two "0"] - which are both false statements here: there is not one "1" glyph so far in the sequence when [11] is read, but two; and there are not two "0" glyph when [20] is read, but only one. The sequence is built with [a(n+1)-a(n)] minimal and a(n+1) always "false so far". This explains why the sequence doesn't begin with [10]: its statement would be true.
After integer [20] the sequence matches A000027 without [100] -- because [100] would be "true so far".
[This seems to imply that the sequence contains all numbers >= 20 except 100. - N. J. A. Sloane, Aug 22 2011]
|
|
|
CROSSREFS
| Cf. A102357.
Sequence in context: A174976 A003284 A063589 * A105957 A105958 A124250
Adjacent sequences: A102812 A102813 A102814 * A102816 A102817 A102818
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Eric Angelini (eric.angelini(AT)kntv.be), Feb 26 2005
|
| |
|
|
