46312

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.at n=43A024467
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.at n=42A025087
• Numerators of continued fraction convergents to sqrt(932).at n=10A042802
• Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.at n=27A078356
• Minimal positive solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 or -4 with D(n)=A077425(n). The companion sequence is b(n)=A077058(n).at n=50A078361
• G.f.: A(x) = Series_Reversion( x / Sum_{n>=0} (n+1)!*x^n ).at n=6A136633
• a(0)=1, a(1)=7, a(n)=15*a(n-1)-49*a(n-2) for n>1.at n=5A165322
• Numbers that have 11 terms in their Zeckendorf representation.at n=6A179251
• Number of n X 4 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=5A268770
• Number of nX6 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=3A268772
• T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=39A268774
• T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=41A268774
• Numbers with equal counts of 1's and 0's in both their binary and Zeckendorf representations.at n=10A327911
• Expansion of (1 - x)/(1 - x - 7*x^2).at n=10A367456