22994

Appears in sequences

• a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.at n=34A049726
• Integer part of log(n!)^(1 + log(log(1 + n))).at n=32A062475
• a(n) = ceiling((sqrt n)^(sqrt n)).at n=32A094093
• Number of tatami tilings of a 4 X n grid (with monomers allowed).at n=13A192090
• Number of (n+1)X(1+1) 0..3 arrays colored with the difference of the upper median and the lower median in each 2X2 subblock.at n=2A236037
• Number of (n+1)X(3+1) 0..3 arrays colored with the difference of the upper median and the lower median in each 2X2 subblock.at n=0A236039
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the difference of the upper median and the lower median in each 2X2 subblock.at n=3A236041
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the difference of the upper median and the lower median in each 2X2 subblock.at n=5A236041
• Numbers whose sum of anti-divisors is equal to the sum of the divisors of their arithmetic derivative.at n=23A249912
• Number of integer partitions of n whose Durfee square has sides of even size.at n=41A274523
• The number of plane rooted complete ternary trees with 2n+1 unlabeled leaves (hence n internal nodes including the root where n starts at 0) satisfying these two conditions: (1) if one of the three children of any internal node is the greatest in deglex order then that child is not the leftmost child; (2) if one of the three children of any internal node is the smallest in deglex order then that child is not the rightmost child. Deglex order refers to degree-lexicographical order defined inductively on the number of leaves (see details under Comments).at n=9A287211
• Numbers k such that 385*2^k+1 is prime.at n=38A322998
• a(n) = coefficient of x^n in A(x) such that A(x) = 1 + x*(2*A(x)^3 + A(x^3))/3.at n=9A357538