31171
domain: N
Appears in sequences
- a(n) = 2^n - Fibonacci(n+2).at n=15A008466
- Strong pseudoprimes to base 74.at n=22A020300
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 43 ones.at n=2A031811
- The same as A166461 except for a(1)=43.at n=19A166491
- Number of partitions of n+3 with largest inscribed rectangle having area <= n.at n=36A218624
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes L, U, I.at n=11A251737
- Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s.at n=5A297579
- T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s.at n=50A297582
- Number of 6Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s.at n=4A297587
- a(n) = Sum_{k=1..n} k^2 * floor(n/k)^3.at n=21A350124
- The reversing binary representation of the sum of the divisors of the n-th odd square: a(n) = A065621(A379223(n)).at n=45A379224