35421

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = a(1) = 1.at n=21A001595
• a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.at n=20A066629
• Numbers that are the sum of exactly two sets of Fibonacci numbers.at n=37A122194
• Row sums of triangle A131779.at n=20A131780
• Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 0110-1100-0111 pattern in any orientation.at n=10A146806
• Diagonal sums of number triangle A132046.at n=21A154327
• Dispersion of ([n*x+n+x]), where x=(golden ratio) and [ ]=floor, by antidiagonals.at n=55A191435
• Smallest k such that the number of the first even exponents in prime power factorization of (2*k)! is n, or a(n)=0 if there is no such k.at n=13A241786
• a(n) = a(n-1) + a(n-2) - (-1)^(a(n-1) + a(n-2)) with a(0)=0, a(1)=1.at n=22A253198
• 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=22A255978
• Number of 2Xn arrays containing n copies of 0..2-1 with every element equal to at least one horizontal neighbor and the top left element equal to 0.at n=14A267725
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 2, a(3) = 1.at n=23A295686
• Derangements of {1,2,...,n} (n >= 2) in lexicographic order.at n=33A320588
• a(n) is the smallest b > 1 such that b^n - (b-1)^n has all divisors d == 1 (mod n).at n=43A321576
• Number of Grassmannian permutations of size n that avoid a pattern, sigma, where sigma is a pattern of size 6 with exactly one descent.at n=22A362193