50624
domain: N
Appears in sequences
- List of pairs of consecutive refactorable numbers.at n=6A036898
- Positive numbers which are one less than a perfect square that is also another power.at n=19A062965
- Numbers whose set of base 15 digits is {0,E}, where E base 15 = 14 base 10.at n=15A097261
- Numbers k such that k and k+1 are both refactorable numbers.at n=3A114617
- Smallest number m such that m and m+1 have exactly n prime factors (counted with multiplicity).at n=7A115186
- a(n) = n^4 - 1.at n=14A123865
- a(n) = 4*(3*n+1)*(3*n+2).at n=37A144410
- Positive integers k such that there is no m different from k where both d(k) = d(m) and d(k+1) = d(m+1), where d(k) is the number of positive divisors of k.at n=40A161460
- Numbers n such that n^2 XOR n^3 is a square, where XOR is the bitwise XOR operator.at n=23A261808
- Integers k such that k and k+1 are products of 8 primes.at n=0A268469
- E.g.f.: -tanh(x)*LambertW(-x).at n=7A277480
- Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 9).at n=14A322298
- Numbers k such that k and k+1 are both half-Zumkeller numbers (A246198).at n=10A331371
- a(n) is the least number k such that A348213(k) = n, or -1 if no such number exists.at n=3A348214
- Numbers k such that k and k+1 are both divisible by the number of their divisors over the Eisenstein integers.at n=4A351854
- Square array T(n, k), n >= 2 and k >= 1, read by antidiagonals in ascending order, give the smallest number that starts a sequence of exactly k consecutive numbers each having exactly n prime factors (counted with multiplicity), or -1 if no such number exists.at n=29A375160
- The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 8.at n=1A387518
- Even positive numbers that are one less than the square of a perfect power.at n=8A389955