39650

Appears in sequences

• Sum of Fermat coefficients.at n=13A000967
• Number of aperiodic binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=28A006206
• Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2*n+3)*(2*n-1).at n=31A030440
• Number of cyclic compositions of n into parts >= 2.at n=28A032190
• Number of binary rooted trees with n nodes and height exactly 6.at n=25A036595
• Number of orbits of length n under the map whose periodic points are counted by A001350.at n=28A060280
• (L(p)-1)/p where L() are the Lucas numbers (A000032) and p runs through the primes.at n=9A064723
• a(n) = Sum_{k = 0..floor(n/2)} floor(C(n-k,k)/(k+1)).at n=26A095719
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n that start with exactly k (1,1) steps.at n=28A110169
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n that start with exactly k (1,1) steps.at n=37A110169
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n that start with exactly k (1,1) steps.at n=47A110169
• First differences of the central Delannoy numbers (A001850).at n=7A110170
• Product(1 + a(n)*x^n, n=1..infinity) = sum(F(k+1)*x^k, k=1..infinity) = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=28A147542
• Result of using the Fibonacci numbers as coefficients in an infinite polynomial series in x and then expressing this series as (1+a(1)x)(1+a(2)x^2)(1+a(3)x^3)...at n=28A147558
• 1/Product_{n>=1} (1 - a(n)*x^n) = 1 + Sum_{k>=1} F(k+1)*x^k = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=28A157162
• a(n) = floor(phi^n/n), where phi = golden ratio = (1+sqrt(5))/2.at n=28A172128
• Integer nearest (1/n)*(r^n), where r = golden ratio = (1 + sqrt(5))/2.at n=28A181885
• The maximum possible value for the apex of a triangle of numbers whose base consists of a permutation of the numbers 0 to n, and each number in a higher row is the sum of the two numbers directly below it.at n=12A189390
• a(n) = numerator of B(0,n) where B(n,n) = 0, B(n-1,n) = 1/n, and B(m,n) = B(m-1,n+1) - B(m-1,n).at n=28A189731
• G.f.: Product_{n>=1} (1 - Lucas(n)*x^n + (-1)^n*x^(2*n)) where Lucas(n) = A000204(n).at n=22A203860