Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102815
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102815 "False so far" sequence. Last digit of a(n) must be seen as a glyph and 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)] being minimal and a(n+1) always "false so far". This explains why the sequence doesn't begin with [10]: its statement would be true. +0
1
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; listen)
OFFSET

11,1

COMMENT

After integer [20] the sequence matches A000027 without [100] -- because [100] would be "true so far".

CROSSREFS

Cf. A102357.

Sequence in context: A129909 A003284 A063589 this_sequence A105957 A105958 A124250

Adjacent sequences: A102812 A102813 A102814 this_sequence A102816 A102817 A102818

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Feb 26 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research