22256

Appears in sequences

• Number of 4-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=4.at n=16A027559
• Trajectory of 3 under map n->37n+1 if n odd, n->n/2 if n even.at n=12A037116
• Numbers n such that (n + prime(n)), (n+1 + prime(n+1)), (n+2 + prime(n+2)) and (n+3 + prime(n+3)) are divisible by 5.at n=15A107582
• Number of diagonal rectangles with corners on an n X n grid of points.at n=17A113751
• Poincaré series [or Poincare series] P(T_{4,2}; x).at n=11A124616
• Number of (n+2) X (2+2) 0..2 arrays with every 3 X 3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=4A252222
• Number of (n+2) X (5+2) 0..2 arrays with every 3 X 3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=1A252225
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=16A252228
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row and column sum 2 3 or 4 and every diagonal and antidiagonal sum not 2 3 or 4.at n=19A252228
• Expansion of Product_{k>=1} 1/(1 - x^k)^(k*(k+1)^2/2).at n=8A302447
• a(n) = Glaisher's function beta(2n+1).at n=37A322032
• Numbers that cannot be expressed as the sum of one or more numbers without any repeated digits.at n=14A342080
• Greater of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor.at n=2A357496
• E.g.f. satisfies A(x) = 1/(1 - x * exp(x) * A(x)^2)^2.at n=4A377527