18571

Appears in sequences

• Numbers that are the sum of 2 positive 7th powers.at n=8A003369
• Numbers that are the sum of at most 2 positive 7th powers.at n=13A004864
• Numbers that are the sum of at most 3 positive 7th powers.at n=26A004865
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 41 ones.at n=1A031809
• Centered cube numbers: (n+1)^7 + n^7.at n=3A036085
• CONTINUANT transform of squares 1, 4, 9, ...at n=4A036246
• Numbers k that divide 4^k + 3^k.at n=7A045584
• Numbers k that divide 8^k + 6^k.at n=30A045601
• Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).at n=12A045941
• a(n) = 3^n + 4^n.at n=7A074605
• Numbers that can be represented as a^7 + b^7, with 0 < a < b, in exactly one way.at n=5A088719
• a(n) is the (n-1)st smallest number that is the sum of 2 distinct positive n-th powers.at n=5A088727
• Expansion of (1-7x)/((1-x)(1-9x)(1-10x)).at n=4A097168
• Sum of 7th powers of digits of n.at n=34A123253
• Main diagonal of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j,k-1) for 2 <= k <= j.at n=15A129339
• Row sums of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j-1,k) for 2 <= k <= j.at n=14A131024
• T(n,k)=Number of (n+1)X(n+1) -k..k symmetric matrices with every 2X2 subblock having sum zero.at n=33A210694
• Numbers which are the sums of consecutive seventh powers.at n=8A217847
• Numbers n such that n, n + 1, n + 2, n + 3 and n + 4 are products of exactly three primes.at n=11A268588
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 430", based on the 5-celled von Neumann neighborhood.at n=35A272116