279937

Appears in sequences

• Numbers that are the sum of 2 positive 7th powers.at n=15A003369
• Numbers that are the sum of at most 2 positive 7th powers.at n=22A004864
• Numbers k such that k | 6^k + 1.at n=21A015953
• Numbers k such that k^2 is palindromic in base 6.at n=31A029990
• Sums of 2 distinct powers of 6.at n=21A038478
• Numbers whose cube is palindromic in base 6.at n=8A046235
• a(n) = n*6^n + 1.at n=6A050917
• Sums of two powers of 6.at n=28A055257
• Fourth step in Goodstein sequences, i.e., g(6) if g(2)=n: write g(5)=A059934(n) in hereditary representation base 5, bump to base 6, then subtract 1 to produce g(6).at n=8A059935
• a(n) = 6^n + 1.at n=7A062394
• Numbers of the form (6^{mr}-1)/(6^r-1) for positive integers m, r.at n=15A076285
• Numbers that can be represented as a^7 + b^7, with 0 < a < b, in exactly one way.at n=10A088719
• a(n) = n^(n+1) + 1.at n=6A110567
• Pierpont 4-almost primes: numbers with exactly 4 prime divisors, not necessarily distinct, of the form 2^K*3^L + 1.at n=9A111344
• Sum of 7th powers of digits of n.at n=16A123253
• Duplicate of A110567.at n=6A123570
• a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3 - 2. It may be considered a Fermat near miss by 2.at n=35A163827
• a(n) = smallest number that leads to a new cycle under the base-6 Kaprekar map of A165051.at n=10A165068
• Numbers of the form 6^j + 9^k, for j and k >= 0.at n=41A226830
• a(n) = n^7 + 1.at n=6A258806