28635

Appears in sequences

• Apply partial sum operator twice to Fibonacci numbers.at n=19A001924
• Spiral sieve using Fibonacci numbers.at n=21A005625
• 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=41A024467
• 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=40A025087
• a(n) = T(2*n, n+1), T given by A027935.at n=9A027937
• Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2).at n=17A079921
• a(n)= -a(n-1) +5*a(n-2) +5*a(n-3) -a(n-4) -a(n-5).at n=16A107402
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (0, 1), (1, -1), (1, 0)}.at n=11A151408
• One-half of averages of twin prime pairs of A001318.at n=19A154565
• Array associated with "the Mysterious B Sequence", by antidiagonals.at n=53A186158
• Number of 2n-step paths from (0,0) to (0,n) that stay in the first quadrant (but may touch the axes) consisting of steps (-1,0), (0,1), (0,-1) and (1,-1).at n=8A306813
• a(n) = Sum_{d|n} sigma_3(d).at n=27A321140
• a(n) = a(n-2) + 2*a(n-4) - a(n-10), with a[0..9] = [1, 1, 1, 1, 1, 2, 3, 5, 6, 9].at n=33A366143