A282112 -id:A282112 - cp's OEIS frontend

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)d_i = Sum_{i=1..j-1} (j-i)d_i. Case b = 10.

101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, 222, 232, 242, 252, 262, 272, 282, 292, 303, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 414, 424, 434, 444, 454, 464, 474, 484, 494, 505, 515, 525, 535, 545, 555, 565, 575, 585, 595, 606, 616, 626

Offset: 1

Paolo P. Lava, Feb 06 2017

All the numbers that are palindromic in base 10 and have an odd number of digits belong to this sequence.

Here the fulcrum is one of the digits while in the sequences from A282143 to A282151 it is between two digits.

			10467: if j = 2 (digit 6) we have 4*1 + 0*2 + 1*3 = 7 for the left side and 7*1 = 7 for the right side.

Paolo P. Lava, Table of n, a(n) for n = 1..10000

Cf. A282107, A282108, A282109, A282110, A282111, A282112, A282113, A282114.

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,10),i=1..10^3);

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.

Original entry on oeis.org

37, 43, 49, 55, 61, 67, 74, 80, 86, 92, 98, 104, 111, 117, 123, 129, 135, 141, 148, 154, 160, 166, 172, 178, 185, 191, 197, 203, 209, 215, 218, 222, 224, 230, 236, 242, 248, 255, 258, 261, 267, 273, 279, 285, 292, 294, 298, 304, 310, 316, 322, 329, 330, 335, 341

Offset: 1

Paolo P. Lava, Feb 06 2017

All the palindromic numbers in base 6 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 6 are:
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, ...

			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.

Paolo P. Lava, Table of n, a(n) for n = 1..10000

Cf. A282107 - A282110, A282112 - A282115.

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,6),i=1..10^3);

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.

Original entry on oeis.org

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

Offset: 1

Paolo P. Lava, Feb 06 2017

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

			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.

Paolo P. Lava, Table of n, a(n) for n = 1..10000

Cf. A282107 - A282112, A282114, A282115.

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);

cp's OEIS Frontend

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)d_i = Sum_{i=1..j-1} (j-i)d_i. Case b = 10.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

cp's OEIS Frontend

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)*d_i = Sum_{i=1..j-1} (j-i)*d_i. Case b = 10.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

A282115 Numbers m with k digits in base b (MSD(m)=d_k, LSD(m)=d_1) such that, for one of their digits in position d_k < j < d_1, Sum_{i=j+1..k} (i-j)d_i = Sum_{i=1..j-1} (j-i)d_i. Case b = 10.

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.

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.