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!)
A108116 Base 10 weak Skolem-Langford numbers. 4

%I

%S 2002,131003,231213,300131,312132,420024,12132003,14130043,15120025,

%T 23121300,23421314,25121005,25320035,30023121,31213200,31413004,

%U 34003141,40031413,41312432,45001415,45121425,45300435,50012152,51410054,52002151,52412154,53002352,53400354,61310036

%N Base 10 weak Skolem-Langford numbers.

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

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

%C Largest element is a(20120) = 978416154798652002.

%D E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.

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

%e 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.

%Y Base 10 strong Skolem-Langford numbers are in A132291.

%K base,easy,fini,full,nonn

%O 1,1

%A _Eric Angelini_, Jun 26 2005, Aug 10 2007

%E Edited by _N. J. A. Sloane_, Nov 18 2007

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