cp's OEIS Frontend

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.

A214437 Least numbers whose groups of 2,3,...,n digits taken from the left are divisible by 2,3,...,n.

This page as a plain text file.
%I A214437 #52 Apr 08 2025 10:02:00
%S A214437 1,10,102,1020,10200,102000,1020005,10200056,102000564,1020005640,
%T A214437 10200056405,102006162060,1020061620604,10200616206046,
%U A214437 102006162060465,1020061620604656,10200616206046568,108054801036000018,1080548010360000180,10805480103600001800
%N A214437 Least numbers whose groups of 2,3,...,n digits taken from the left are divisible by 2,3,...,n.
%C A214437 The first 11 terms of the sequence are coincident with A078282.
%C A214437 a(6) is formed with 66,7 % zeros;  A(5) with 60 %; a(7) with 57,1 %; a(4), a(8), a(10) and a(20) with 50 %.
%C A214437 a(n) is the first term of A144688 with n digits, except that A144688 includes zero as first term. - _Franklin T. Adams-Watters_, Jul 18 2012
%C A214437 There are 25 terms in the sequence; the 25-digit number 3608528850368400786036725 is the last number to satisfy the requirements. - _Shyam Sunder Gupta_, Aug 04 2013
%H A214437 Shyam Sunder Gupta, <a href="/A214437/b214437.txt">Table of n, a(n) for n = 1..25</a>
%H A214437 Shyam Sunder Gupta, <a href="https://doi.org/10.1007/978-981-97-2465-9_22">On Some Special Numbers</a>, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 22, 527-565.
%e A214437 a(6) = 102000 because 10, 102, 1020, 10200 and 102000 are divisible by 2, 3, 4, 5 and 6.
%e A214437 There are nine one-digit numbers that are divisible by 1; the smallest is 1, so a(1)=1.
%e A214437 For two-digit numbers, the second digit must be even, i.e., 0,2,4,6,8 to make it divisible by 2, which gives 10 as the smallest number to satisfy the requirement, so a(2)=10. - _Shyam Sunder Gupta_, Aug 04 2013
%t A214437 a=Table[j, {j, 9}]; r=2; t={};
%t A214437 While[!a == {}, n=Length[a]; nmin=Last[a]; k=1; b={};
%t A214437 While[!k>n, z0=a[[k]]; Do[z=10*z0+j; If[Mod[z, r]==0, b=Append[b, z]], {j, 0, 9}]; k++]; AppendTo[t, nmin]; a=b; r++]; t (* _Shyam Sunder Gupta_, Aug 04 2013 *)
%Y A214437 Cf. A078282, A158242, A144688.
%K A214437 nonn,base,fini,full
%O A214437 1,2
%A A214437 _Robin Garcia_, Jul 17 2012