82908

Appears in sequences

• Expansion of e.g.f. cosh(log(1+x)^2).at n=8A009140
• Sum of binary numbers with n 1's and two (non-leading) 0's.at n=9A059938
• Triangle given by T(n,k) = Fibonacci(n+k+1)*binomial(n,k) for 0<=k<=n.at n=51A122070
• a(n) = 5*p^5 - 3*p^3 - 2*p^2, where p = prime(n).at n=3A133061
• a(n) = 5*n^5 - 3*n^3 - 2*n^2.at n=7A134630
• Triangle T(n, k) = n! * binomial(n, k)*( psi(n-k+1) - psi(k+1) ), read by rows.at n=30A157521
• a(n) = 64*n^2 - n.at n=35A157948
• a(n) = 256*n^2 - 2*n.at n=17A158249
• a(n) = 1296*n^2 - 36.at n=7A158737
• A binomial transform of Fibonacci numbers.at n=48A185384
• Number of n X 7 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 1 vertically.at n=14A208779
• Triangular array read by rows: T(n,k) is the number of functional digraphs on {1,2,...,n} such that every element is mapped to a recurrent element and there are exactly k cycles, n>=1, 1<=k<=n.at n=41A228534
• Number of partitions of 2n into distinct parts < n.at n=41A231429
• Nonsquare numbers whose sum of proper square divisors is a square greater than 1.at n=29A232555
• Numbers whose sum of proper square divisors is a square greater than 1.at n=34A232556
• The area of a primitive Heronian triangle K, such that K = k^2*n for the least k, where n is the sequence index.at n=46A247381