46370

Appears in sequences

• Pisot sequence L(4,5).at n=21A018910
• Pisot sequence L(7,10).at n=19A020743
• a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=26A022875
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.at n=57A024466
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.at n=56A024595
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000045, t = A023533.at n=56A025086
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (F(2), F(3), F(4), ...), t = A023533.at n=55A025109
• Pisot sequence L(5,7).at n=20A048584
• Expansion of (1-x)/(1-2*x^2-x^3).at n=26A078024
• a(1)=1, a(2)=1 and for n > 2, a(n) is the smallest positive integer such that the third-order absolute difference gives the Fibonacci numbers A000045 = {1,1,2,3,5,8,...}.at n=23A086651
• Partial sums of (-1)^n*Fibonacci(n-1).at n=26A112469
• a(n) = Fibonacci(n) + 2.at n=24A157725
• Number of sets of exactly six positive integers <= n having a square element sum.at n=26A281866
• E.g.f.: Sum_{n>=0} x^n * exp( x*exp(n*x) ) / n!.at n=7A340909