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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132291 Base 10 strong Skolem-Langford numbers. 4
12132003, 23121300, 30023121, 31213200, 1214230043, 1312432004, 2342131400, 2412134003, 3004312142, 3400324121, 4002342131, 4131243200, 1213267345006475, 1213275364005746, 1214267540036573, 1214273645300765, 1214275640035763, 1215247365430076 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Self-describing numbers: between two digits "d" there are d digits.

a(n) has either 0 or 2 instances of any digit, hence even number of digits.

"Strong" means that every digit from 0 to the largest digit of a(n) must be present in a(n).

Number of digits of a(n) == 0 or 2 (mod 8)

Largest element is a(2820) = 867315136875420024.

LINKS

D. Wilson, Complete table of n, a(n) for n = 1..2820

CROSSREFS

Base 10 Skolem-Langford numbers are in A108116.

Sequence in context: A022227 A206750 A178056 * A263391 A204888 A268418

Adjacent sequences:  A132288 A132289 A132290 * A132292 A132293 A132294

KEYWORD

base,easy,fini,full,nonn

AUTHOR

Eric Angelini, Jun 26 2005, Aug 10 2007

EXTENSIONS

Edited by N. J. A. Sloane, Nov 18 2007

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 7 13:06 EST 2019. Contains 329845 sequences. (Running on oeis4.)