login

Revision History for A303501

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Lexicographically earliest sequence of distinct positive terms such that the digits of a(n) together with the first digit of a(n+1) can be arranged to form a base-10 palindrome.
(history; published version)
#21 by Susanna Cuyler at Sun Dec 01 23:14:22 EST 2019
STATUS

proposed

approved

#20 by Jon E. Schoenfield at Sun Dec 01 22:25:59 EST 2019
STATUS

editing

proposed

#19 by Jon E. Schoenfield at Sun Dec 01 22:25:56 EST 2019
COMMENTS

The sequence starts with a(1) = 1 and is always extended with the smallest integer not present that doesn't lead to a contradiction.

Comment from N. J. A. Sloane, Apr 27 2018 : (Start):

EXAMPLE

The the digits of a(2) = 10 together with the 1 of a(3) = 11 form 101;

The the digits of a(3) = 11 together with the 2 of a(4) = 2 form 121;

The the digit of a(4) = 2 together with the 2 of a(5) = 20 forms 22;

The the digits of a(5) = 20 together with the 2 of a(6) = 21 form 202;

The the digits of a(6) = 21 together with the 1 of a(7) = 12 form 121;

The the digits of a(7) = 12 together with the 1 of a(8) = 13 form 121;

The the digits of a(8) = 13 together with the 3 of a(9) = 3 form 313;

STATUS

approved

editing

#18 by N. J. A. Sloane at Fri Apr 27 18:20:40 EDT 2018
STATUS

editing

approved

#17 by N. J. A. Sloane at Fri Apr 27 18:20:38 EDT 2018
COMMENTS

Comment from N. J. A. Sloane, Apr 27 2018 (Start):

It is not difficult to prove that a(n+1) always exists. As in the proof that A228407 contains every number, classify numbers m into 2^10 classes according to the parity of the numbers of 0's, 1's, ..., 9's they contain. Let W(m) denote the binary weight of the class that m belongs to.

A necessary and sufficient condition for there to exist a digit x such that the digits of a(n) and x can be rearranged to form a palindrome is that W(a(n)) = 0 or 1. If W(a(n)) = 0 then x can be any nonzero digit, while if W(a(n)) = 1 then x can be chosen to be the digit that appears an odd number of times in a(n), as long as that digit is not zero.

We now choose a(n+1) to begin with x, and choose the remaining digits of a(n+1) so that the digits of a(n+1) again have the required property. (End)

STATUS

approved

editing

#16 by N. J. A. Sloane at Fri Apr 27 17:02:19 EDT 2018
STATUS

editing

approved

#15 by N. J. A. Sloane at Fri Apr 27 17:02:17 EDT 2018
NAME

Lexicographically earliest sequence of distinct positive terms such that the digits of a(n) together with the first digit of a(n+1) can be reordered arranged to form a base-10 palindrome.

STATUS

approved

editing

#14 by N. J. A. Sloane at Fri Apr 27 16:59:21 EDT 2018
STATUS

editing

approved

#13 by N. J. A. Sloane at Fri Apr 27 16:59:18 EDT 2018
NAME

Lexicographically earliest sequence of distinct positive terms such that the digits of a(n) together with the first digit of a(n+1) could can be reordered to form a base-10 palindrome number.

STATUS

approved

editing

#12 by N. J. A. Sloane at Thu Apr 26 11:07:53 EDT 2018
STATUS

editing

approved