1149850
domain: N
Appears in sequences
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=28A001610
- Partial sums of squares of Lucas numbers.at n=13A005970
- Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=28A007040
- Inflation orbit counts.at n=28A031367
- a(n) = Lucas(4n+1) - 1, or 5*Fibonacci(2n)*Fibonacci(2n+1).at n=7A081017
- a(n) = Lucas(n) + (-1)^n.at n=29A099925
- a(n) = A014217(n+1) - A115360(n+2).at n=27A142584
- Row sums of triangle defined in A096539.at n=9A160909
- Continued fraction expansion for exp( Sum_{n>=1} 1/(n*Lucas(n)) ), where Lucas(n) = A000032(n) = ((1+sqrt(5))/2)^n + ((1-sqrt(5))/2)^n.at n=41A174505
- Position of first occurrence of n in A182576.at n=27A182580
- Expansion of x*(1 + 2*x)/((1 - x)*(1 + x)*(1 - x - x^2)).at n=28A301653
- Number of nonempty subsets of {1, ..., n} containing no two cyclically successive elements.at n=29A324015
- Define f(x) = abs(1-1/x) and sequence {b(m)} such that b(m+1) = f(b(m)). a(n) is the number of initial values b(1) such that {b(m)}'s period has length n.at n=28A378853