login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102167 Lightest finite strictly increasing sequence of integers showing once and only once every pair of digits from [00] to [99]. The "weight" of such a sequence is the sum of all its a(n). Weight of this sequence is 2995. 1
7, 19, 20, 23, 24, 25, 26, 27, 28, 29, 30, 34, 35, 36, 37, 38, 39, 40, 45, 46, 47, 48, 49, 50, 56, 57, 58, 59, 60, 67, 68, 69, 70, 78, 79, 80, 88, 90, 99, 100, 118, 122, 133, 144, 155, 166, 177 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

It seems that it is only a conjecture that this sequence is really the lightest! - N. J. A. Sloane, Mar 15 2005

LINKS

Table of n, a(n) for n=1..47.

EXAMPLE

Sequence starts with 7 19 20 23... showing pairs [71], [19], [92], [20], [02], [23]...

CROSSREFS

Sequence in context: A052256 A064819 A281915 * A214525 A109637 A039513

Adjacent sequences:  A102164 A102165 A102166 * A102168 A102169 A102170

KEYWORD

base,easy,nonn,fini,full

AUTHOR

Geoff Bailey, Richard Tucker, "Alex" and Eric Angelini, Feb 16 2005; revised Mar 15 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 17:48 EST 2021. Contains 349445 sequences. (Running on oeis4.)