This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A282111 #12 May 30 2019 08:59:05 %S A282111 37,43,49,55,61,67,74,80,86,92,98,104,111,117,123,129,135,141,148,154, %T A282111 160,166,172,178,185,191,197,203,209,215,218,222,224,230,236,242,248, %U A282111 255,258,261,267,273,279,285,292,294,298,304,310,316,322,329,330,335,341 %N A282111 Numbers n with k digits in base x (MSD(n)=d_k, LSD(n)=d_1) such that, chosen one of their digits in position d_k < j < d_1, is Sum_{i=j+1..k}{(i-j)*d_i} = Sum_{i=1..j-1}{(j-i)*d_i}. Case x = 6. %C A282111 All the palindromic numbers in base 6 with an odd number of digits belong to the sequence. %C A282111 Here the fulcrum is one of the digits while in the sequence from A282143 to A282151 is between two digits. %C A282111 Numbers with this property in all the bases from 2 to 6 are: %C A282111 144781, 345440, 743687, 1650704, 4020912, 4270149, 4757093, 6922591, 7102553, 7406643, 7677171, 7823009, 8853188, 12444016, 14457746, 14853520, 14861718, 15794512, 15994195, 17375742, 20450682, 20802565, 22173561, 22186557, 25268754, 261656297, 26648201, 27740672, ... %H A282111 Paolo P. Lava, <a href="/A282111/b282111.txt">Table of n, a(n) for n = 1..10000</a> %e A282111 304 in base 6 is 1224. If j = 2 (the first 2 from right) we have 2*1 + 1*2 = 4 for the left side and 4*1 = 4 for the right one. %p A282111 P:=proc(n,h) local a,j,k: a:=convert(n, base, h): %p A282111 for k from 1 to nops(a)-1 do %p A282111 if add(a[j]*(k-j),j=1..k)=add(a[j]*(j-k),j=k+1..nops(a)) then %p A282111 RETURN(n); break: fi: od: end: seq(P(i,6),i=1..10^3); %Y A282111 Cf. A282107 - A282110, A282112 - A282115. %K A282111 nonn,base,easy %O A282111 1,1 %A A282111 _Paolo P. Lava_, Feb 06 2017