22212

Appears in sequences

• k th digit of a(n) is the number of different digits within 3 of k (not including k).at n=14A039989
• k th digit of a(n) is the number of different digits within 4 of k (not including k).at n=14A039990
• Numbers having four 2's in base 10.at n=7A043500
• Number of complementary pairs of circulant graphs on n nodes.at n=38A054929
• Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.at n=22A059364
• Sum of the reflection lengths of all permutations of n letters.at n=6A067318
• Primes of form 4k+3 written in base 3.at n=27A072805
• Triangle read by rows: T(n,k) = n*T(n-1,k-1) + k*T(n-1,k) starting with T(0,0)=1.at n=34A078341
• Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.at n=34A088996
• Triangle read by rows: T(n,1) = 1, T(n,k) = T(n-1,k)+(n-1)*T(n-1,k-1) for 1<=k<=n+1.at n=41A096747
• Triangle read by rows: T(n,1)=1, T(n,k) = T(n-1,k) + (n-1)T(n-1, k-1) for 1 <= k <= n.at n=33A109822
• a(n) is the least positive integer in base 10 containing n twos that is divisible by n.at n=3A112893
• Triangle read by rows: row n (n>=0) has g.f. Sum_{i=1..n} n!*x^i*(1+x)^(n-i)/(n+1-i).at n=34A126671
• In triangular peg solitaire, number of distinct feasible pairs starting with one peg missing and finishing with one peg.at n=33A130515
• In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.at n=33A130516
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k 3-term arithmetic progressions (n>=0; 0<=k<=floor((n-1)^2/4)).at n=51A162982
• Record differences for n^2 - phi(n)*sigma(n).at n=32A164876
• Conway notation for rational 2-component links.at n=27A173637
• Number of distinct solutions of sum{i=1..5}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2.at n=9A180817
• a(n) is the smallest positive multiple of n whose decimal digits are all 0, 1 or 2.at n=35A181060