Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102167
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
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; listen)
OFFSET

7,1

COMMENT

It seems that it is only a conjecture that this sequence is really the lightest! - njas, Mar 15 2005

EXAMPLE

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

CROSSREFS

Sequence in context: A125257 A052256 A064819 this_sequence A109637 A039513 A125265

Adjacent sequences: A102164 A102165 A102166 this_sequence A102168 A102169 A102170

KEYWORD

base,easy,nonn,fini,full,nice

AUTHOR

Geoff Bailey, Richard Tucker, "Alex", and Eric Angelini (eric.angelini(AT)kntv.be), Feb 16 2005; revised Mar 15 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research