36312

Appears in sequences

• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(2) = 4.at n=38A050039
• Record values in A106530.at n=19A106531
• A transform of floor((n+2)/2) with Hankel transform floor((n+2)/2)*(cos(Pi*n/2) + sin(Pi*n/2)).at n=14A134389
• Numbers such that the digital sums in bases 3, 4, 5 and 6 all are equal.at n=30A135126
• Numbers such that the digital sums in bases 3, 4, 5, 6 and 7 all are equal.at n=16A135129
• Numbers k such that there are 10 digits in k^2 and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square.at n=15A153748
• a(n) = 1728*n + 24.at n=20A157325
• Number of reduced 3 X 3 magilatin squares with largest entry n.at n=19A174018
• Number of partitions of n+10 with largest inscribed rectangle having area <= n.at n=30A218631
• Number of n X 2 0..6 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling six exactly once.at n=2A269932
• Number of nX3 0..6 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling six exactly once.at n=1A269933
• T(n,k)=Number of nXk 0..6 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling six exactly once.at n=7A269937
• T(n,k)=Number of nXk 0..6 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling six exactly once.at n=8A269937
• G.f. A(x) satisfies A(x) = 1 + x^3*(1+x)*A(x)^3.at n=21A376547