|
Search: id:A108116
|
|
|
| A108116 |
|
Base 10 weak Skolem-Langford numbers. |
|
+0
3
|
|
| 2002, 131003, 231213, 300131, 312132, 420024, 12132003, 14130043, 15120025, 23121300, 23421314, 25121005, 25320035, 30023121, 31213200, 31413004, 34003141, 40031413, 41312432, 45001415, 45121425, 45300435, 50012152, 51410054, 52002151, 52412154, 53002352, 53400354, 61310036
(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.
Largest element is a(20120) = 978416154798652002.
|
|
REFERENCES
|
E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.
|
|
LINKS
|
D. Wilson, Complete table of n, a(n) for n = 1..20120
|
|
EXAMPLE
|
In "2002" there are 2 digits between the two 2's and 0 digits between the two 0's; in "131003" there is 1 digit between the two 1's, 3 digits between the two 3's and 0 digit between the two 0's.
|
|
CROSSREFS
|
Base 10 strong Skolem-Langford numbers are in A132291.
Sequence in context: A162239 A104400 A154049 this_sequence A140920 A162240 A127351
Adjacent sequences: A108113 A108114 A108115 this_sequence A108117 A108118 A108119
|
|
KEYWORD
|
base,easy,fini,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Jun 26 2005, Aug 10 2007
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 18 2007
|
|
|
Search completed in 0.002 seconds
|
