32897

Appears in sequences

• Numbers that are the sum of 4 positive 7th powers.at n=26A003371
• Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=38A024850
• Multiplicity of highest weight (or singular) vectors associated with character chi_24 of Monster module.at n=40A034412
• Multiplicity of highest weight (or singular) vectors associated with character chi_169 of Monster module.at n=40A034557
• Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.at n=36A065160
• a(n) = 2^(2^n - 1) + 2^(2^(n + 1) - 1) + 1.at n=3A119571
• Indices in A261283 where records occur.at n=25A253317
• a(n) is the least positive integer that differs (in absolute value) by an (n+1)-st power from the reverse of its binary representation.at n=5A278930
• Numbers with exactly 3 ones in both binary and ternary representations.at n=51A281004
• a(n) = 2^(n - 1) * (2^n + 1) + 1.at n=8A281481
• Expansion of Sum_{p prime, i>=1} p^i*x^(p^i)/(1 - x^(p^i)) / Product_{j>=1} (1 - x^j).at n=24A281906
• Number of rooted unlabeled trees on n nodes where each node has at most 8 children.at n=14A292553
• BII-numbers of uniform regular set-systems.at n=48A326785
• BII-numbers of maximal uniform set-systems (or complete hypergraphs).at n=42A327080
• Numbers k such that the k-th standard ordered rooted tree is a generalized Bethe tree (counted by A003238).at n=38A358377
• Numbers whose product of binary indices is a prime power > 1.at n=38A371290