20801

Appears in sequences

• Pseudoprimes to base 60.at n=36A020188
• Strong pseudoprimes to base 70.at n=18A020296
• Values of Newton-Gregory forward interpolating polynomial (1/6)*(4*n^4 - 60*n^3 + 347*n^2 - 927*n + 978).at n=17A030442
• Smallest Fibonacci number that has n as a factor, divided by n.at n=39A037943
• a(1) = 1, then add, multiply, subtract, multiply 2, 3, 4, 5; 6, 7, 8, 9; ... in that order.at n=10A077384
• a(n) = a(n-1) + 64*a(n-2) starting with a(0) = 2 and a(1) = 1.at n=5A081708
• Multiples of 11 with digit sum 11, with no zero digits in odd places.at n=24A083512
• First differences of A084449.at n=37A084465
• Quotient Fibonacci(5*n)/(5*Fibonacci(n)), where Fibonacci(n) = A000045(n).at n=5A088545
• Quotient F(n(n+1))/{F(n)*F(n+1)}, where F(n) is the n-th Fibonacci number A000045(n).at n=4A103624
• a(n) = n*(n+2)*(2*n-1)/3. Also, row sums of triangle A131422.at n=30A131423
• Duplicate of A131423.at n=30A143371
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 0), (1, -1, 0), (1, 0, 1), (1, 1, -1)}.at n=8A149478
• Eleven times hexagonal numbers: a(n) = 11*n*(2*n-1).at n=31A154617
• Hankel transform of A158500.at n=30A158501
• a(n) = 52*n^2 + 1.at n=20A158644
• (1/n)*A205446(n).at n=39A205447
• Number of unimodal functions [1..n]->[0..2].at n=25A223718
• Number of nX1 0..n*1-1 arrays with upper left zero and lower right n*1-1 and each element differing from its horizontal and vertical neighbors by a power of two.at n=8A265173
• T(n,k)=Number of nXk 0..n*k-1 arrays with upper left zero and lower right n*k-1 and each element differing from its horizontal and vertical neighbors by a power of two.at n=36A265178