46832

Appears in sequences

• Number of compositions (ordered partitions) of n into squares.at n=33A006456
• a(1) = a(2) = 1. For n >=3, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, below a(n-1) if such a positive integer exists. Otherwise, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, above a(n-1).at n=39A118627
• Triangle where T(n,k) = number of compositions of n^2 - k^2 into sums of squares for k=0..n, n>=0, as read by rows.at n=32A232266
• Expansion of 1 / (1 - 2 * Sum_{k>=1} x^(k^2)).at n=14A329971
• Expansion of (theta_3(x) - 1)^2 / (2 * (3 - theta_3(x))).at n=31A347805
• Expansion of (theta_3(x) - 1)^3 / (4 * (3 - theta_3(x))).at n=30A347806