4278190080

Appears in sequences

• a(n) = 4^n - n^6.at n=16A024042
• 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=17A068778
• 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=17A068788
• Jordan function J_8(n).at n=15A069093
• Rewrite n in binary with each digit occurring n times (see example). a(n) is the decimal equivalent.at n=7A162472
• Decimal equivalents of A268229.at n=24A268230
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 814", based on the 5-celled von Neumann neighborhood.at n=31A286866
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 422", based on the 5-celled von Neumann neighborhood.at n=31A288125
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 878", based on the 5-celled von Neumann neighborhood.at n=31A290659
• Number of copies of the star graph S(2,1,1) contained within the n-dimensional hypercube graph.at n=16A352847
• a(n) is the least k such that A161606(k) = n or a(n) = -1 if no such k exists.at n=27A385677
• Smallest integer k whose sum of its distinct prime factors and bigomega(k) both equal n; or -1 if no such integer exists.at n=25A386605