|
Search: id:A102827
|
|
|
| A102827 |
|
"True already", base 10, start 1: a(n) is the least integer such that the sequence up to a(n-1) written in base 10 contains floor(a(n)/10) copies of the digit a(n) % 10, with a(0) = 1. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 26, 27, 28, 29, 33, 34, 35, 36, 37, 38, 39, 44, 45, 46, 47, 48, 49, 55, 56, 57, 58, 59, 66, 67, 68, 69, 77, 78, 79, 88, 89, 99, 111, 112, 113, 114, 115, 116, 117, 118, 119, 122, 123
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Conjecture: this sequence in various bases never includes a term divisible by the base
|
|
REFERENCES
|
Inspired by discussion of "True so far" from Eric Angelini (A102357)
|
|
EXAMPLE
|
The first 9 values of the sequence written in decimal include no '0's and 1 '1', so the next value cannot be 10 (the count of '0's is not 1) but can be 11.
|
|
CROSSREFS
|
Cf. A102823-A102830, A102357.
Sequence in context: A032857 A009994 A072544 this_sequence A055571 A132781 A070698
Adjacent sequences: A102824 A102825 A102826 this_sequence A102828 A102829 A102830
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
hv(AT)crypt.org (Hugo van der Sanden), Feb 26 2005
|
|
|
Search completed in 0.002 seconds
|
