64082

Appears in sequences

• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Lucas numbers), t = A023533.at n=56A024476
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000032, t = A023533.at n=55A025096
• Numbers that are not squarefree and whose Euler totient function is squarefree.at n=41A049198
• Numbers k such that sigma(k)*phi(k) is squarefree.at n=25A065299
• Triangle, T(n, k) = [x^k]( p(x, n) ), where (1/2)*(1-x)^(n+1) * Sum_{j >= 0} ((4*j + 3)^n + (4*j+1)^n )*x^j, read by rows.at n=22A154647
• Triangle, T(n, k) = [x^k]( p(x, n) ), where (1/2)*(1-x)^(n+1) * Sum_{j >= 0} ((4*j + 3)^n + (4*j+1)^n )*x^j, read by rows.at n=26A154647
• Number of scalene triangles, distinct up to congruence, on an n X n grid (or geoboard).at n=24A190313
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=8A252151
• Where records occur in A070138.at n=41A298942
• Number of positive integers k <= prime(n)# so that (k mod p_1) < (k mod p_2) < ... < (k mod p_n).at n=9A325057
• Numbers k such that phi(k) == 2 (mod 12), where phi is the Euler totient function (A000010).at n=28A332511
• a(n) = Lucas(n) + 3.at n=22A366506