cp's OEIS Frontend

A284814 Least number k such that k mod (2, 3, 4, ... , n+1) = (d_1, d_2, ..., d_n), where d_1 , d_2, …, d_n are the digits of n, with MSD(n) = d_1 and LSD(n) = d_n. 0 if such a number does not exist.

%I A284814 #8 Apr 10 2017 12:34:33
%S A284814 1,0,0,0,11311,0,1032327,11121217,101033565,0,10333633323,0,0,
%T A284814 11121314781937,0
%N A284814 Least number k such that k mod (2, 3, 4, ... , n+1) = (d_1, d_2, ..., d_n), where d_1 , d_2, …, d_n are the digits of n, with MSD(n) = d_1 and LSD(n) = d_n. 0 if such a number does not exist.
%C A284814 Suggested by Francis Maleval in Linkedin "Number Theory" group.
%e A284814 a(11) = 10333633323 because:
%e A284814 10333633323 mod 2 = 1, 10333633323 mod 3 = 0, 10333633323 mod 4 = 3,
%e A284814 10333633323 mod 5 = 3, 10333633323 mod 6 = 3, 10333633323 mod 7 = 6,
%e A284814 10333633323 mod 8 = 3, 10333633323 mod 9 = 3, 10333633323 mod 10 = 3,
%e A284814 10333633323 mod 11 = 2, 10333633323 mod 12 = 3.
%p A284814 P:=proc(q) local a,d,j,k,n,ok; for k from 1 to q do d:=0; for n from 10^(k-1) to 10^k-1 do
%p A284814 ok:=1; a:=n; for j from 1 to ilog10(n)+1 do if (a mod 10)<>n mod ((ilog10(n)+2-j)+1)
%p A284814 then ok:=0; break; else a:=trunc(a/10); fi; od; if ok=1 then print(n); d:=1; break; fi; od;
%p A284814 if n=10^k and d=0 then print(0); fi; od; end: P(20);
%Y A284814 Cf. A284815.
%K A284814 nonn,base,hard,more
%O A284814 1,5
%A A284814 _Paolo P. Lava_, Apr 10 2017
%E A284814 a(12)-a(15) from _Giovanni Resta_, Apr 10 2017