463680

Appears in sequences

• a(n+2) = (2n+3)*a(n+1) + (n+1)^2*a(n), a(0) = 1, a(1) = 1.at n=7A012244
• Fibonacci sequence beginning 0, 10.at n=24A022093
• a(n) = n!*(3*n-1)/2.at n=7A066118
• n! times sum of Farey fractions of order n.at n=7A093593
• Triangle T(n, k) = n! * StirlingS1(n, k)/binomial(n, k), read by rows.at n=33A142473
• a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.at n=24A153382
• A Galton triangle: T(n,k) = 2*k*T(n-1,k) + (2*k-1)*T(n-1,k-1).at n=30A187075
• Triangle T(n,k), 0<=k<=n, given by (0,2,0,4,0,6,0,8,0,10,0,...) DELTA (1, 2, 3, 4, 5, 6, 7, 8, 9,...) where DELTA is the operator defined in A084938.at n=39A211402
• Govindarajan's triangle beta arising in enumeration of multi-dimensional partitions, read by rows.at n=35A216808
• Positive numbers differing from next 3 greater squares by squares.at n=20A218487
• Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 2 where empty bins are permitted (m >= 1, 1 <= n <= 2m).at n=48A248844
• Square array whose entry A(n,k) is the number of endofunctions on a set of size n with preimage constraint {0,1,...,k}, for n >= 0, k >= 0, read by descending antidiagonals.at n=52A306800
• Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge.at n=50A368924
• Expansion of e.g.f. 1 / (exp(-x^3) - x).at n=8A375607
• E.g.f. satisfies A(x) = exp(x^3 * A(x)^3 / (1 - x)).at n=8A376495