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!)

Revision History for A108116

(Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A108116 Base 10 weak Skolem-Langford numbers.
(history; published version)
#10 by Nathaniel Johnston at Tue Feb 12 18:18:53 EST 2013
STATUS

editing

approved

#9 by Nathaniel Johnston at Tue Feb 12 18:18:51 EST 2013
KEYWORD

base,easy,fini,full,nonn

STATUS

approved

editing

#8 by Russ Cox at Sat Mar 31 13:46:52 EDT 2012
AUTHOR

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

Discussion
Sat Mar 31 13:46
OEIS Server: https://oeis.org/edit/global/891
#7 by Russ Cox at Fri Mar 30 16:50:17 EDT 2012
EXTENSIONS

Edited by _N. J. A. Sloane (njas(AT)research.att.com), _, Nov 18 2007

Discussion
Fri Mar 30 16:50
OEIS Server: https://oeis.org/edit/global/110
#6 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

D. Wilson, <a href="="/A108116/b108116.txt">Complete table of n, a(n) for n = 1..20120</a>

KEYWORD

base,easy,fini,nonn,new

#5 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
LINKS

D. Wilson, <a href="http://www.research.att.com/~njas/sequences/b108116.txt">Complete table of n, a(n) for n = 1..20120</a>

KEYWORD

base,easy,fini,nonn,new

EXTENSIONS

Edited by N. J. A. Sloane (njas, (AT)research.att.com), Nov 18 2007

#4 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008
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, <a href="http://www.research.att.com/~njas/sequences/b108116.txt"> ">Complete table of n, a(n) for n = 1..20120</a>

KEYWORD

base,easy,fini,nonn,new

#3 by N. J. A. Sloane at Sun Dec 09 03:00:00 EST 2007
NAME

Base- 10 weak Skolem-Langford numbers.

COMMENTS

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

EXAMPLE

In "2002" there are 2 digits between the two 2's and 0 digitdigits 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.

EXTENSIONS

Edited by njas, Nov 18 2007

#2 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007
NAME

AlmostBase-10 Skolem-Langford numbers.

DATA

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

OFFSET

01,1

COMMENTS

Self-describing numbers: between two digits "d" there are d digits. Almost-Langford numbers have an even number of digits and no two identical pairs of digits. The sequence is finite: what is the last term? Could it be 978416154798652002 ?

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.

LINKS

D. Wilson, <a href="http://www.research.att.com/~njas/sequences/b108116.txt"> Complete table of n, a(n) for n = 1..20120</a>

CROSSREFS

Base-10 strong Skolem-Langford numbers are A132291.

KEYWORD

base,easy,fini,nonn,new

AUTHOR

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

#1 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005
NAME

Almost-Langford numbers.

DATA

2002, 131003, 231213, 300131, 312132, 420024, 12132003, 14130043, 15120025, 23121300, 23421314, 25121005, 25320035, 30023121, 31213200, 31413004, 34003141, 40031413, 41312432, 45001415, 45121425, 50012152, 51410054

OFFSET

0,1

COMMENTS

Self-describing numbers: between two digits "d" there are d digits. Almost-Langford numbers have an even number of digits and no two identical pairs of digits. The sequence is finite: what is the last term? Could it be 978416154798652002 ?

EXAMPLE

In "2002" there are 2 digits between the two 2's and 0 digit 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.

KEYWORD

base,easy,fini,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Jun 26 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 7 13:06 EST 2019. Contains 329845 sequences. (Running on oeis4.)