24012

Appears in sequences

• a(n) = Sum_{k=1..n} floor(k^4/n).at n=17A014819
• Numbers k such that 2^k mod k = 2^k mod k^2.at n=36A068535
• Smallest number a(n)>a(n-1) such that T(a(n-1))+T(a(n))=T(m) for some m, a(1)=3; T(i) are the triangular numbers.at n=30A072522
• G.f.: Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 5.at n=43A091773
• Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=21A125773
• Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with no more than 4 ones in any 4 X 4 X 4 subtriangle.at n=10A153932
• "Early bird" squares: write the square numbers in a string 149162536496481100... . Sequence gives numbers k such that k^2 occurs in the string ahead of its natural place.at n=41A181585
• Number of nX3 0..3 arrays with no element equal to the sum of elements to its left or the sum of elements above it or the sum of the elements diagonally to its northwest or the sum of the elements antidiagonally to its northeast, modulo 4.at n=9A240245
• Expansion of Product_{k>=1} 1/(1 - (5*k-3)*x^(5*k-3)).at n=29A265833
• Let e_n(k)>=0 denote the exponent of prime(k) in the prime power representation of n. The sequence lists 1 followed by numbers n for which e_n(2*i-1)=e_n(2*i), for all i>=1.at n=41A275407