524176
domain: N
Appears in sequences
- a(n) = n + n*(n-1)*(n-2)*(n-3)*(n-4).at n=16A001095
- Largest square <= 2^n.at n=18A065732
- Square array T(M,N) read by antidiagonals: number of dimer tilings of a 2M x 2N Klein bottle.at n=33A103999
- Squares which are the sum of two or more consecutive squares.at n=26A151557
- If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 8. See A159741 for details.at n=12A159744
- Number of n X 6 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=10A207401
- Squares equal to the difference between two successive primes of the form n^2+1.at n=22A216330
- Fibonacci 14-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-14).at n=20A220469
- a(n) is the number of perfect matchings of an edge-labeled 2 X n Klein bottle grid graph, or equivalently the number of domino tilings of a 2 X n Klein bottle grid. (The twist is on the length-n side.)at n=19A351635
- a(n) is the largest perfect power < 2^n.at n=16A357752
- a(n) is the largest square with n binary digits.at n=16A357754