22950

Appears in sequences

• Coordination sequence for sigma-CrFe, Position Xb.at n=38A009960
• a(n) = T(n,n-3), where T is the array in A026374.at n=33A026382
• "DFK" (bracelet, size, unlabeled) transform of 2,2,2,2...at n=24A032214
• Numbers whose base-4 representation contains exactly four 1's and four 2's.at n=7A045109
• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=36A050031
• Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).at n=24A053979
• Number of labeled rooted trees with n nodes and 8 leaves.at n=1A055309
• Sum of antidiagonals of A060736.at n=34A061349
• Engel expansion of sinh(1/3).at n=25A068380
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=13.at n=8A135198
• Expansion of (1-3*x+x^2)^2/(1-9*x+28*x^2-35*x^3+15*x^4-x^5).at n=8A216710
• Number of (n+4) X 1 arrays of occupancy after each element moves up to +-4 places including 0.at n=4A222341
• T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places including 0.at n=32A222345
• Number of (n+5)X1 arrays of occupancy after each element moves up to +-n places including 0.at n=3A222349
• Number of (4+2)X(n+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=11A252965
• Expansion of Product_{k>=1} (1 + (x + x^2)^k).at n=16A266108
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 379", based on the 5-celled von Neumann neighborhood.at n=31A271537
• Sum of values of vertices of type A at level n of the hyperbolic Pascal pyramid.at n=9A292295
• Base-2 expansion of a(n) encodes the steps where numbers of the form 4k+3 are encountered when map x -> A252463(x) is iterated down to 1, starting from x=n.at n=52A292383
• G.f.: Product_{n=-oo..+oo} ( 1 + x^n*(1 - x^n)^n ).at n=36A293602