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”).
%I #7 Aug 20 2021 13:35:09
%S 4,8,27,29,31,34,37,39,41,43,46,49,51,53,54,55,59,62,65,66,67,71,74,
%T 77,78,79,246,248,249,251,252,254,256,259,261,263,265,268,270,272,274,
%U 277,282,284,285,287,288,290,292,295,297,299,301,304,306,308
%N Base 3 numbers d(1)...d(j) such that d(i) != d(j+1-i) for all but 2 values of i.
%Y Cf. A050876.
%K nonn,base
%O 1,1
%A _Clark Kimberling_
%E Name corrected and missing initial terms inserted by _Sean A. Irvine_, Aug 20 2021