editing
approved
editing
approved
then RETURN(n); break: fi: od: end: seq(P(i, 10), i=1..10^3);
P:=proc(n, h) local a, j, k: a:=convert(n, base, h): for k from 1 to nops(a)-1 do
for k from 1 to nops(a)-1 do
if add(a[j]*(k-j+1), j=1..k)=add(a[j]*(j-k), j=k+1..nops(a)) then n; fi: od: end:
then n; fi: od: end: seq(P(i, 10), i=1..10^3);
with(numtheory): P:=proc(q, n, h) local a, b, d, j, k, : a:=convert(n, s; base, h): for k from 1 to nops(a)-1 do
for n from 1 to q do a:=convert(n, base, h);
for k from 1 to trunc(nops(a)/2) do b:=a[k]; a[k]:=a[nops(a)-k+1]; a[nops(a)-k+1]:=b; od;
for k from 1 to nops(a)-1 do d:=0; s:=0;
for j from 1 to k do if a[j]>0 then s:=s+a[j]*(k-j+1); fi; od; for j from nops(a) by -1 to k+1 do
if add(a[j]>0 then d:=d*(k-j+1), j=1..k)=add(a[j]*(j-k); fi; od; if d, j=s k+1..nops(a)) then print(n); break; fi; od; : od; : end: P(10^3, 10);
seq(P(i, 10), i=1..10^3);
approved
editing
proposed
approved
editing
proposed
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..k}{(i-j+1)*d_i} = Sum_{i=1..j-1}{(j-i)*d_i}. Case x = 610.
All the palindromic numbers in base 6 10 with an even number of digits belong to the sequence.
proposed
editing
editing
proposed
All the palindromic numbers in base 10 6 with an even number of digits belong to the sequence.
approved
editing
proposed
approved