login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Binary numbers d(1)...d(j) such that d(i) = d(j+1-i) for all but two values of i.
3

%I #8 Aug 20 2021 05:51:27

%S 2,4,6,8,11,13,14,16,19,20,23,25,26,29,30,32,35,37,41,44,47,49,50,55,

%T 59,61,62,64,67,69,72,75,77,81,84,87,89,92,95,97,98,103,105,106,111,

%U 115,117,118,123,125,126,128,131,133,137,145,152

%N Binary numbers d(1)...d(j) such that d(i) = d(j+1-i) for all but two values of i.

%C Each number becomes a palindrome by changing one digit.

%Y Cf. A051247, A050874.

%K nonn,base

%O 1,1

%A _Clark Kimberling_

%E Name corrected by _Sean A. Irvine_, Aug 20 2021