login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102829 "True already", base 3, start 1: a(n) is the least integer such that the sequence up to a(n-1) written in base 3 contains floor(a(n)/3) copies of the digit a(n) % 3, with a(0) = 1. 0
1, 2, 4, 5, 8, 13, 14, 17, 23, 29, 32, 35, 41, 44, 50, 56, 62, 67, 74, 76, 82, 88, 92, 95, 98, 104, 110, 113, 116, 122, 125, 131, 137, 143, 152, 161, 173, 179, 188, 193, 202, 206, 215, 223, 226, 232, 238, 244, 250, 256, 263, 269, 274, 278, 284, 287, 293, 299 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

Inspired by discussion of "True so far" from Eric Angelini (A102357)

CROSSREFS

Cf. A102823-A102830, A102357.

Sequence in context: A039842 A188216 A116901 * A031988 A023745 A178656

Adjacent sequences:  A102826 A102827 A102828 * A102830 A102831 A102832

KEYWORD

nonn,easy,base

AUTHOR

hv(AT)crypt.org (Hugo van der Sanden), Feb 26 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:09 EST 2012. Contains 205570 sequences.