67968

Appears in sequences

• Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n^2.at n=18A065089
• Number of quasi-triominoes in an n X n bounding box.at n=25A094170
• Records in A087029.at n=8A186443
• Number of lunar divisors (A087029) of the decimal numbers 1, 10, 11, 100, 101, 110, 111, 1000, ... .at n=30A186508
• Number of lunar divisors of the decimal (lunar) number 111...1 (with n 1's).at n=4A186510
• Number of lunar divisors (in base 10) of the n-th number whose decimal expansion contains only 0's and 1's and begins and ends with a 1 (A099821(n)).at n=15A186943
• Number of lunar divisors (in base 10) of the n-th nonzero number whose decimal expansion contains only 0's and 1's (A007088(n)).at n=30A186951
• Numbers with prime factorization pq^2r^7.at n=26A190466
• Number of (n+1) X 3 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=5A206200
• Number of (n+1)X7 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=1A206204
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=22A206206
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=26A206206
• Number of key comparisons to sort all n! permutations of n elements by quicksort.at n=7A288964
• Integers m that satisfy tau(m) + omega(m) = #({phi(x) = m}).at n=31A305656
• Triangle read by rows: T(n,k) is the number of generalized permutations related to the degenerate Eulerian numbers with exactly k ascents (0 <= k <= max(0,n-1)).at n=23A336633
• Triangle read by rows: T(n,k) is the number of generalized permutations related to the degenerate Eulerian numbers with exactly k ascents (0 <= k <= max(0,n-1)).at n=27A336633