35420

Appears in sequences

• Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.at n=21A019274
• a(n) = C(n+2, 2) + C(n+2, 3) + C(n+2, 4) + C(n+2, 5).at n=20A027660
• a(n) = n*(n+1)*(n+2)*(n+3)/6.at n=20A033488
• 1 / min{1/n - 1/a - 1/b > 0}, where a and b are integers.at n=19A045470
• a(n) = n * [1 + sum(k=1 to n-1) prime(k)].at n=28A083719
• Partial sums of repeated Fibonacci sequence.at n=41A094707
• a(n) = (4/(n + 1)) * C(5*n, n).at n=5A124724
• a(n) = binomial(n^2,n+1)/n.at n=3A177456
• The number of equal-sized equilateral triangles in the highest stack of triangles contained in successive Genealodrons formed from 2^n - 1 same size equilateral triangles.at n=21A179316
• Length of the n-th term in the modified Look and Say sequence A110393.at n=39A179999
• Number of binary vectors v of length n with curling number 1 such that the concatenation v v with first term omitted also has curling number 1.at n=16A216958
• Array t(n,k) = binomial(n*k, n+1)/n, where n >= 1 and k >= 2, read by ascending antidiagonals.at n=31A241262
• a(n) = n*(n + 1)*(n + 2)*(3*n + 17)/24.at n=21A241765
• a(n) = a(n-1) + a(n-2) + (1 - (-1)^(a(n-1) + a(n-2))) with a(0) = 0, a(1) = 1.at n=21A253197
• Even numbers such that the sum of the even divisors and the sum of the odd divisors are a square or a cube.at n=26A263695
• a(n) is the number of subsets of {1..n} that contain exactly 1 odd and 3 even numbers.at n=45A330299
• Partial sums of L(1) - F(1) + L(2) - F(2) + L(3) - F(3) + ..., where L = A000032 and F = A000045.at n=41A355019
• Number of partitions of n with rank 4 or higher (the rank of a partition is the largest part minus the number of parts).at n=45A363231