43320

Appears in sequences

• Expansion of 1/((1+x)*(1-x)^5).at n=35A001752
• Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...).at n=19A051165
• a(n) = n*(n+1)*(2*n^3 - n^2 + 2)^2/6.at n=4A101382
• Positive integers i for which A112049(i) == 9.at n=12A112069
• a(n) = n^2*(n^2 - 1)/3.at n=19A112742
• a(n) = (prime(n)^4 - prime(n)^2)/3.at n=7A138419
• Lower triangular array called S1hat(5) related to partition number array A144890.at n=39A144891
• Ordered (2,2)-selections from the multiset {1,1,2,2,3,3,...,n,n}.at n=20A188667
• Antidiagonal sums of the convolution array A213822.at n=14A213824
• a(n) = 30*n^2.at n=38A244636
• Array of basis permutations, seen as a triangle read by rows: Row k (k >= 0) gives the values of b(n, k) = number of permutations of size n (2 <= n <= 2(k+1)) in the permutation basis B(k) (see Comments for further details).at n=60A265163
• a(n) = 27*n^2 - 51*n + 24, n>=1.at n=40A304836
• Orders of perfect non-simple groups.at n=56A327912
• a(n) = -(-1)^n * n! * hypergeometric1F1(1 - n, 2, 4*n).at n=5A332680
• a(n) is the frequency of multi-pairs in a sequence of multi-set designs with 2 blocks.at n=4A335649
• T(n,k) is the number of labeled connected posets of n labeled elements with k covering relations (n>=1, k>=0). Triangle read by rows.at n=24A342588
• a(n) = (2*n^4 - 6*(-1)^n*n^2 - 2*n^2 + 3*(-1)^n - 3)/96.at n=38A350050
• Numbers that are divisible by the square of the sum of the squares of their digits.at n=33A379980