A036211 -id:A036211 - cp's OEIS frontend

A097968 Consider the succession of single digits of the positive even integers: 2 4 6 8 1 0 1 2 1 4 1 6 1 8 2 0 2 2 2 4 ... (A036211). This sequence is the lexicographically earliest sequence of distinct positive odd integers that produces the same succession of digits.

2468101, 21, 41, 61, 82022242628303, 23, 43, 63, 84042444648505, 25, 45, 65, 86062646668707, 27, 47, 67, 88082848688909, 29, 49, 69, 81001021041061081, 101, 1, 211, 411, 611, 81, 201, 221, 241, 261, 281, 301, 3, 213, 413, 613, 81401, 421, 441

Offset: 1

Eric Angelini, Sep 22 2004

Original name: "Write each odd integer >0 on a single label. Put the labels in numerical order to form an infinite sequence L. Now consider the succession of single digits of A005843 (even numbers): 2 4 6 8 1 0 1 2 1 4 1 6 1 8 2 0 2 2 2 4 2 6 2 8 3 0 3 2 3 4 3 6 3 8... The sequence S gives a rearrangement of the labels that reproduces the same succession of digits, subject to the constraint that the smallest label must be used that does not lead to a contradiction."

This could be roughly rephrased like this: Rewrite in the most economical way the "even numbers pattern" using only odd numbers, but rearranged. All the numbers of the sequence must be different one from another.

			We must begin with "2,4,6..." and we cannot use "2" or "24" or "246" (only odd terms are available), so the first possibility is "2468101". We could not have used "24681" since no term begins with a 0.

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Eric Angelini, Jeux de suites, in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.

Cf. A005408, A005843, A098099.

f[lst_List, k_] := Block[{L = lst, g, w, a = {}, m}, g[x_] := First@ FirstPosition[x, i_ /; OddQ@ i]; Do[w = Take[L, g@ L]; L = Drop[L, Length@ w]; m = Take[L, g@ L]; While[Or[MemberQ[a, FromDigits@ w], IntegerLength@ FromDigits@ m < Length@ m], w = Join[w, m]; L = Drop[L, Length@ m]; m = Take[L, g@ L]]; AppendTo[a, FromDigits@ w], {k}]; a]; f[Flatten@ Map[IntegerDigits, 2 Range@ 80], 40] (* Michael De Vlieger, Nov 28 2015, Version 10 *)

Name and Example edited by Danny Rorabaugh, Nov 28 2015

A097481 Write the positive even integers on labels in numerical order, forming an infinite sequence L. Consider the succession of digits of L: 2 4 6 8 1 0 1 2 1 4 1 6 1 8 2 0 2 2 2 4 2 6 2 8 3 0 ... (A036211). This sequence gives a derangement of L that produces the same succession of digits, subject to the constraint that the smallest unused label must be used that does not lead to a contradiction.

Original entry on oeis.org

24, 6, 8, 10, 12, 14, 16, 18, 20, 2, 224, 26, 28, 30, 32, 34, 36, 38, 40, 4, 244, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132

Offset: 1

Eric Angelini, Sep 19 2004

Derangement here means the n-th element of L is not the n-th element of this sequence, so a(n) != 2n.

			We must begin with 2,4,6,8,... and we cannot have a(1) = 2, so the first possibility is the label "24". The next term must be the smallest available label not leading to a contradiction, thus "6". The next one will be "8", etc. After the label "20" the smallest available label is "2". After this "2" we cannot have a(11) = 22 -- we thus take the smallest available label which is "224". No label is allowed to start with a leading zero.

Cf. A005843, A097484.

Corrected and extended by Jacques ALARDET and Eric Angelini, Aug 12 2008

Derangement wording introduced by Danny Rorabaugh, Nov 26 2015

cp's OEIS Frontend

A097968 Consider the succession of single digits of the positive even integers: 2 4 6 8 1 0 1 2 1 4 1 6 1 8 2 0 2 2 2 4 ... (A036211). This sequence is the lexicographically earliest sequence of distinct positive odd integers that produces the same succession of digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions