36784

Appears in sequences

• a(n) = T(4n,n), where T is the array in A026300.at n=5A026304
• Number of (n+1)X(2+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14.at n=2A233647
• Number of (n+1)X(3+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14.at n=1A233648
• T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14 (14 maximizes T(1,1)).at n=7A233653
• T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 14 (14 maximizes T(1,1)).at n=8A233653
• Numbers that are values of the totient function (A002202) but not of the reduced totient function (A002174).at n=13A270265
• (n + 1)^3*a(n + 1) = 2*(2*n + 1)*(5*n^2 + 5*n + 2)*a(n) - 8*n*(7*n^2 + 1)*a(n - 1) + 22*n*(n - 1)*(2*n - 1)*a(n - 2), with a(0) = 1, a(1) = 4 and a(2) = 28.at n=5A284756
• One of the three successive approximations up to 7^n for 7-adic integer 6^(1/3). This is the 6 (mod 7) case (except for n = 0).at n=6A319199
• One of the three successive approximations up to 7^n for 7-adic integer 6^(1/3). This is the 6 (mod 7) case (except for n = 0).at n=7A319199
• a(n) = number of minimum dominating sets in the stacked prism graph C_n X P_n.at n=18A375569