97108

Appears in sequences

• Sum of Fermat coefficients.at n=14A000967
• Number of aperiodic binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=30A006206
• Number of cyclic compositions of n into parts >= 2.at n=30A032190
• Denominators of continued fraction convergents to sqrt(184).at n=14A041341
• Number of orbits of length n under the map whose periodic points are counted by A001350.at n=30A060280
• (L(p)-1)/p where L() are the Lucas numbers (A000032) and p runs through the primes.at n=10A064723
• a(n) = Sum_{k = 0..floor(n/2)} floor(C(n-k,k)/(k+1)).at n=28A095719
• 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=30A147542
• 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=30A147558
• 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=30A157162
• a(n) = floor(phi^n/n), where phi = golden ratio = (1+sqrt(5))/2.at n=30A172128
• Integer nearest (1/n)*(r^n), where r = golden ratio = (1 + sqrt(5))/2.at n=30A181885
• 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=30A189731
• Largest multiple of n which can be formed as concatenation of the next n numbers, {1+n(n-1)/2,...,n(n+1)/2} (written in decimal), or 0 if no such number exists.at n=3A192392
• Number of n-bit binary necklaces (unmarked cyclic n-bit binary strings) containing no runs of length > 2.at n=30A316660
• Inverse Euler transform applied once to {1,-1,0,0,0,...}, twice to {1,0,0,0,0,...}, or three times to {1,1,1,1,1,...}.at n=31A320767