32000
domain: N
Appears in sequences
- Values of phi(k) when phi(k) = phi(k+1).at n=33A003275
- a(n) = Product_{i=0..6} floor((n+i)/7).at n=31A009641
- Numbers of form 2^i*10^j, with i, j >= 0.at n=43A025612
- Numbers of form 4^i*5^j, with i, j >= 0.at n=31A025617
- Number of perfect matchings in graph P_{2} X P_{4} X P_{n}.at n=4A028448
- Number of perfect matchings in graph P_{4} X P_{4} X P_{n}.at n=2A028454
- a(n) = 4*n^3.at n=20A033430
- Numbers whose prime factors are 2 and 5.at n=38A033846
- a(n) = ceiling((n^3)/2).at n=40A036486
- a(n) = floor((n^3)/2).at n=40A036487
- Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*10^j.at n=13A038288
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*8^j.at n=11A038310
- a(n)^2 is the smallest square containing exactly n 0's.at n=6A048345
- Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.at n=39A050442
- a(n)=2*a(n-1), except every tenth time you multiply by 1000/512 instead of by 2.at n=15A051535
- Numbers of the form 2^i*5^j where i+j is odd.at n=29A054774
- Numbers whose square has more than 2/3 of its digits the same.at n=23A060813
- a(n) = n*20^(n-1).at n=3A061650
- a(n) is smallest number >= a(n-1) such that a(n) plus any set of the previous values of the sequence is a nonsquare; starting with a(1) = 2.at n=19A064776
- a(n) is smallest number >= a(n-1) such that a(n) plus any set of the previous values of the sequence is a nonsquare; starting with a(1) = 2.at n=18A064776