22458

Appears in sequences

• a(1)=1 then a(n)= (1/2) *(5*a(n-1)+1) if a(n-1) is odd, a(n)=3/2*a(n-1) otherwise.at n=14A086813
• Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.at n=7A094788
• Terms in A112039 that are divisible by 3, divided by 3.at n=36A112040
• Number of (n+1) X (2+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=1A234551
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=4A234555
• 25-gonal pyramidal numbers: a(n) = n*(n+1)*(23*n-20)/6.at n=18A256645
• Expansion of (1/x) * Series_Reversion( x * ((1-x)^2-x^4) ).at n=7A369160
• Irregular triangle read by rows: T(n,k) is the sum of the widths of the free polyominoes with n cells and width k, n >= 1, 1 <= k <= ceiling(n/2).at n=41A379637