18949

Appears in sequences

• Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=37A018836
• Numerators of continued fraction convergents to sqrt(481).at n=7A041918
• Numbers n such that Maple 9.5, Maple 10, Maple 11 and Maple 12 give the wrong answers for the number of partitions of n.at n=15A110375
• Number of n X 4 binary arrays with each 1 adjacent to exactly two other 1s.at n=10A183325
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k blocks of length 2 (0 <= k <= floor(n/2)). A block of a permutation is a maximal sequence of consecutive integers which appear in consecutive positions. For example, the permutation 5412367 has 4 blocks: 5, 4, 123, and 67; one of them is of length 2.at n=20A184183
• Composite numbers coprime to 6 such that A179382(n) = A000265(n-1), the odd part of n-1.at n=29A225913
• Partial sums of A147562.at n=37A272928
• a(n) = (Sum_{i=1..n-1} i^(n-2)) mod n^3.at n=41A284759
• For 1<=x<=n, 1<=y<=n, with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = sum of the values of u^2+v^2.at n=26A345431
• G.f. A(x) satisfies: 0 = Sum_{n>=1} (Lucas(n) - A(x))^n * x^n/n, where Lucas(n) = A000204(n).at n=4A353050
• Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1).at n=38A357694