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!)
A194356 Triangle of divisors of 10^n, each number occurring once. 5

%I #43 Feb 19 2024 14:18:22

%S 1,2,5,10,4,20,25,50,100,8,40,125,200,250,500,1000,16,80,400,625,1250,

%T 2000,2500,5000,10000,32,160,800,3125,4000,6250,12500,20000,25000,

%U 50000,100000,64,320,1600,8000,15625,31250,40000,62500,125000,200000,250000

%N Triangle of divisors of 10^n, each number occurring once.

%C The following rule for divisibility applies: for each term t in the n-th row of the triangle, a positive integer m is divisible by t if the last n digits of m are divisible by t; e.g., for n = 2, since 20 is one of the terms in the 2nd row of the triangle, a number m is divisible by 20 if the last 2 digits of m are divisible by 20. - _Martin Renner_, Jan 15 2023

%H T. D. Noe, <a href="/A194356/b194356.txt">Rows for n = 0..100</a>

%e The n-th row of the triangle begins with 2^n and ends with 10^n:

%e 1;

%e 2, 5, 10;

%e 4, 20, 25, 50, 100;

%e 8, 40, 125, 200, 250, 500, 1000;

%e 16, 80, 400, 625, 1250, 2000, 2500, 5000, 10000;

%p T:={{1}}:

%p for n from 1 to 9 do

%p T:={op(T),numtheory[divisors](10^n) minus numtheory[divisors](10^(n-1))};

%p od:

%p T; # _Martin Renner_, Jan 16 2023

%t Join[{{1}}, Table[Complement[Divisors[10^n], Divisors[10^(n-1)]], {n, 9}]]

%o (Python)

%o from sympy import divisors

%o A194356 = []

%o for k in range(0,7): # shows the terms in the range 10^0 ... 10^6

%o for divisor in divisors(10**k):

%o if divisor not in A194356: A194356.append(divisor)

%o print(A194356) # _Karl-Heinz Hofmann_, Feb 19 2024

%o (Python)

%o from math import isqrt

%o def A194356(n):

%o exp = isqrt(n)

%o aarray = [2**exp, 10**exp]

%o while aarray[-1] % 2 == 0: aarray.append(aarray[-1]//2)

%o while aarray[0] * 5 < 10**exp: aarray = [aarray[0]*5] + aarray

%o return sorted(aarray)[n-exp**2]

%o print([A194356(n) for n in range(0,49)]) # _Karl-Heinz Hofmann_, Feb 19 2024

%o (PARI) row(n) = my(pow2 = 2^n, pow5 = 5^n); Set(concat(vector(n+1, i, pow5*2^(i-1)), vector(n,i,pow2*5^(i-1)))) \\ _David A. Corneth_, Feb 19 2024

%Y Cf. A000079 (1st column), A011557 (right diagonal).

%Y Cf. A003592 (numbers of the form 2^i*5^j).

%Y Cf. A194357 (divisors of 6^n), A194358 (divisors of 30^n).

%K nonn,tabf

%O 0,2

%A _T. D. Noe_, Aug 25 2011

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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)