48701

Appears in sequences

• Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=30A096000
• Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=46A157531
• Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=53A157531
• Number of strings of numbers x(i=1..n) in 0..5 with sum i*x(i) equal to n*5.at n=10A184699
• Number of strings of numbers x(i=1..11) in 0..n with sum i*x(i) equal to n*11.at n=4A184711
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 481", based on the 5-celled von Neumann neighborhood.at n=40A272457
• Values of w(k) when w(k-2), w(k-1), and w(k) are all odd, where w is A336957.at n=14A338071
• Number of nonnegative solutions to (x_1)^2 + (x_2)^2 + ... + (x_9)^2 <= n.at n=21A341404
• Rademacher's partition formula extended to half-integers. a(n) = round(sqrt(48) * (cosh(h(n)) - sinh(h(n))/h(n)) / (24*n + 11)) where h(n) = sqrt(24*n + 11)*(Pi/6).at n=41A376876