22165
domain: N
Appears in sequences
- Quadruples of different integers from [ 2,n ] with no global factor.at n=28A015627
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=40A018836
- Numbers k such that phi(k)+sigma(k) is a perfect cube.at n=16A061366
- a(n) = Sum_{i=1..n} i^2*t(i), where t = A000217.at n=10A086689
- Numbers n such that the middle coefficient of the cyclotomic polynomial Phi_n(x) has a value not obtained for any smaller n.at n=14A095877
- Partial sums of Chebyshev sequence S(n,12)= U(n,6)=A004191(n).at n=4A097827
- a(n) = A108466(A025487).at n=42A108467
- Larger members of primitive phi-amicable pairs.at n=14A121249
- Numbers n such that twice the sum of the prime factors of n equals the product of the digits of n.at n=28A125309
- Numbers k such that phi(k)=p^2, where p is product of digits of k.at n=7A153427
- Partial sums of the binomial coefficients binomial(3*n,n) (A005809).at n=6A188675
- Number of days after Mar 01 00 such that the date written in the format DD.MM.YY is palindromic.at n=18A210887
- Rhonda numbers in vigesimal number system.at n=4A255732
- Number of orbits of Aut(Z^7) as function of the infinity norm n of the representative lattice point of the orbit, when the cardinality of the orbit is equal to 26880.at n=31A266397
- Number of nX2 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=8A297817
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=46A297823
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=53A297823
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=46A297993
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=53A297993
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=46A298653