31515

Appears in sequences

• Number of n-node rooted trees of height at most 8.at n=14A034825
• Odd numbers with exactly 4 distinct palindromic prime factors.at n=12A046406
• a(n) = round(log_2(n)*2^n/n).at n=16A065617
• a(n) = ceiling(log_2(n)*2^n/n).at n=16A065618
• Binomial transform of squares of Catalan numbers.at n=6A087804
• Numbers n such that n*359# +-1 are twin primes, where 359# = 72nd primorial (A002110(72)).at n=28A087907
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 9.at n=29A136977
• Rectangular array T(n,k) = binomial(n+1,2)*(n^k - (n-1)^k) read by antidiagonals.at n=40A178831
• Nodes of tree generated as follows: (1,2) is an edge, and if (x,y) is an edge, then (y, y^2 - x^2) and (y, y^2 + x^2) are edges.at n=21A228940
• The number of P-positions in the game of Nim with up to 5 piles, allowing for piles of zero, such that the number of objects in the largest pile is n.at n=21A241731
• Number of powerful rooted trees with n nodes.at n=31A317707