4259840

Appears in sequences

• a(n) = 6^n mod n^6.at n=15A066610
• S(n; 0,1) = S(n; 2,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=12A068711
• S(n; 0,3) = S(n; 2,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=12A068777
• S(n; 1,1) = S(n; 3,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=12A068778
• S(n; 1,3) = S(n; 3,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=12A068788
• a(n) = (2*n+1)*2^floor((n+1)/2).at n=32A097578
• Expansion of g.f. (1 - x)^2*(1 + x) / (1 - 2*x)^2.at n=19A106472
• a(n) = (4*n - 3) * 2^(n - 1).at n=16A118415
• (n^3+n)*8^n.at n=4A128048
• Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9.at n=12A234133
• G.f.: 1 = ...((((1/(1-x) - a(1)*x )^2 - a(2)*x^2 )^2 - a(3)*x^3 )^2 - a(4)*x^4 )^2 -..., an infinite series of nested squares.at n=12A274961
• a(n) is the least number that is the product of n primes (not necessarily distinct) and is the sum of n consecutive primes, or 0 if there are none.at n=17A339269
• Heinz numbers of integer partitions whose product equals their length.at n=33A353699