150000
domain: N
Appears in sequences
- Triangle of coefficients in expansion of (1+10x)^n.at n=25A013617
- Triangle of coefficients in expansion of (4 + 5*x)^n.at n=25A013628
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*10^j.at n=19A038228
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*4^j.at n=23A038246
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*8^j.at n=22A038250
- Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*5^j.at n=26A038283
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*1^j.at n=23A038303
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*3^j.at n=16A038305
- a(n) is the number of n-digit multiples of n.at n=5A061772
- 10th binomial transform of (1,1,0,0,0,0,...).at n=5A081122
- 10th binomial transform of (0,0,1,0,0,0,...).at n=6A081140
- Hypotenuses for which there exist exactly 5 distinct Pythagorean triangles.at n=30A084649
- Length of repeating cycle of the final n digits in the Fibonacci sequence.at n=4A096363
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiples of the sum of their digits (and n raised to k+1 must not be such a multiple). Case k=14.at n=14A135199
- Inverse of A038303, and generalization of A130595.at n=23A165293
- Totally multiplicative sequence with a(p) = 5p for prime p.at n=47A166626
- Totally multiplicative sequence with a(p) = 10*(p+3) for prime p.at n=11A167329
- Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=14A168651
- The number of n-digit numbers requiring 4 nonzero squares in their representation as sum of squares.at n=5A180347
- Numbers n such that 10^11 + n^2 is a square.at n=2A180974