22250

Appears in sequences

• Let Do(n)=A006566(n)=n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i)=Do(j)+Do(k), ordered by increasing i; sequence gives j values.at n=11A053018
• Numbers n such that n^2 can be split into two nonzero squares (perhaps with leading zeros) in exactly two different ways.at n=8A054737
• a(n) = number of partitions of primes into distinct (also odd) parts.at n=18A064688
• Number of ways to partition 2n+1 into distinct positive integers.at n=33A078408
• Number of ways to partition 4*n+3 into distinct positive integers.at n=16A078410
• Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.at n=41A102437
• Sums of Pythagorean sextuples in increasing order: The sums of sets of six natural numbers which correspond to the lengths of the edges of a tetrahedron whose four faces are all different Pythagorean triangles.at n=38A248548
• Expansion of (1 + 6*x + x^2 + 12*x^3 - 2*x^4)/((1 - x)^4*(1 + x)^3).at n=38A268579
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=31A270234
• Triangle read by rows, T(n, k) = (n-k)*T(n-1, k-1) + k*T(n-1, k+1) except that T(n, k) = 0 if k<1 or k>n and T(n, n) = 1, for n>=0 and 0<=k<=n.at n=61A272774
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=15A291844
• Column 2 of triangle A291844.at n=2A294162
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-3) + b(n-1), where a(0) = 1, a(1) = 2, a(2) = 3, b(0) = 4, b(1) = 5, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295613
• Total sum over all j in [n] of the number of partitions of [j*(n-j)] into (n-j) sets of size j.at n=7A370407