48622

Appears in sequences

• Number of shifted Young tableaux with height <= 3.at n=14A082395
• a(n) = Sum_{k=0..n} binomial(9*n,9*k).at n=2A094213
• Number of closed walks of length n at a vertex of the cyclic graph on 9 nodes C_9.at n=18A094233
• Integers n > 1 such that A130280(4n^2) < n, i.e., there is an m < n, m > 1 such that 4n^2(m^2 - 1) + 1 is a square.at n=26A130281
• Elements of A011185 that are also the sum of a pair of distinct elements of A011185.at n=23A133605
• a(n) = floor(6^n/(2+sqrt(5))^n).at n=31A240734
• Number of partitions p of n such that (number of odd numbers in p) is a part of p.at n=44A241545
• a(n) = Sum_{k=0..floor(n/9)} binomial(n,9*k).at n=18A306860
• a(n) = [x^n] Product_{k>=1} (1 + x^k)^tau_n(k), where tau_n(k) = number of ordered n-factorizations of k.at n=10A321192
• T(n, k) is the total number of non-symmetric peaks in all partitions of n with exactly k blocks, n >= 4, 3 <= k <= n-1.at n=23A370373