37020

Appears in sequences

• Least number beginning with n such that every partial sum is a square.at n=36A095158
• a(0)=0, a(1)=5, a(n)=a(n-1)+a(n-2)-1.at n=21A187891
• Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one.at n=4A206047
• Number of (n+1)X6 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=0A206051
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=10A206054
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one.at n=14A206054
• Number of (n+1) X (5+1) 0..1 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=12A253432
• Number of (5+1) X (n+1) 0..1 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=12A253439
• Numbers k such that the sum of the divisors of k is of the form m^3 + 1.at n=36A289384
• a(n) is the total binary weight of all persolus bitstrings of length n.at n=23A335206
• Number of integer partitions of n with no adjacent parts having quotient > 2.at n=46A342094
• Number of partitions of the n-th Fibonacci number into a Fibonacci number of Fibonacci parts.at n=12A343537
• Number of chordless cycles in the complement of the n X n antelope graph.at n=11A370110