19132

Appears in sequences

• a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=31A022905
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 84 ones.at n=15A031852
• Integers k such that 10^k - 33 is prime.at n=26A108364
• Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1.at n=30A239059
• 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=33A248548
• Number of partitions of n with eight parts in which no part occurs more than twice.at n=40A320596
• Integers which can be written in exactly three ways as sum of two distinct nonzero pentagonal numbers.at n=16A333013
• a(n) is the smallest k such that A361902(k) = n, or -1 if no such k exists.at n=49A361999
• a(n) is the number of distinct volumes > 0 of tetrahedra with edges of integer length whose largest is n.at n=15A371345
• Expansion of (1 - x - x^5)/((1 - x - x^5)^2 - 4*x^6).at n=20A375284