Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132291
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132291 Base 10 strong Skolem-Langford numbers. +0
3
12132003, 23121300, 30023121, 31213200, 1214230043, 1312432004, 2342131400, 2412134003, 3004312142, 3400324121, 4002342131, 4131243200, 1213267345006475, 1213275364005746, 1214267540036573, 1214273645300765, 1214275640035763, 1215247365430076 (list; graph; listen)
OFFSET

1,1

COMMENT

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: A028241 A123086 A022227 this_sequence A022217 A133373 A077302

Adjacent sequences: A132288 A132289 A132290 this_sequence A132292 A132293 A132294

KEYWORD

base,easy,fini,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Jun 26 2005, Aug 10 2007

EXTENSIONS

Edited by njas, Nov 18 2007

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 December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research