31097
domain: N
Appears in sequences
- Fibonacci sequence beginning 4, 17.at n=17A022134
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Lucas numbers).at n=21A024319
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (Lucas numbers).at n=20A024882
- a(n) = 46*n^2 + 1.at n=26A158632
- Numbers k such that, taken together, the base-10 and base-b expansions of k are pandigital for some b < 10.at n=11A174596
- Number of n X 7 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 7 array.at n=13A220031
- Numbers n such that prime(n) + reversal(prime(n)) is a square.at n=30A227371
- Number of Motzkin paths of length n with no peaks at level 3.at n=13A257104
- Expansion of Product_{k>=1} (1 + x^k)^phi(k), where phi() is the Euler totient function (A000010).at n=27A299069
- a(n) = Sum_{p in P} (H(2,p)^2)/2, where P is the set of partitions of n, and H(2,p) is the number of hooks of length 2 in p.at n=29A302348