login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282113 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 = 8. 4
65, 73, 81, 89, 97, 105, 113, 121, 130, 138, 146, 154, 162, 170, 178, 186, 195, 203, 211, 219, 227, 235, 243, 251, 260, 268, 276, 284, 292, 300, 308, 316, 325, 333, 341, 349, 357, 365, 373, 381, 390, 398, 406, 414, 422, 430, 438, 446, 455, 463, 471, 479, 487, 495 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All the palindromic numbers in base 8 with an odd number of digits belong to the sequence.
Here the fulcrum is one of the digits while in the sequence from A282143 to A282151 is between two digits.
Numbers with this property in all the bases from 2 to 8 are: 2438269535, 6936679443, 8657968788, 11107027008, 21733512704, ... - Giovanni Resta, Feb 13 2017
LINKS
EXAMPLE
1084 in base 8 is 2074. If j = 2 (digit 7) we have 0*1 + 2*2 = 4 for the left side and 4*1 = 4 for the right one.
MAPLE
P:=proc(n, h) local a, j, k: a:=convert(n, base, h):
for k from 1 to nops(a)-1 do
if add(a[j]*(k-j), j=1..k)=add(a[j]*(j-k), j=k+1..nops(a)) then
RETURN(n); break:fi: od: end: seq(P(i, 8), i=1..10^3);
CROSSREFS
Sequence in context: A095535 A095523 A335582 * A060877 A113688 A364028
KEYWORD
nonn,base,easy
AUTHOR
Paolo P. Lava, Feb 06 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 20:24 EDT 2024. Contains 372413 sequences. (Running on oeis4.)