49075

Appears in sequences

• Numbers n such that n | 5^n + 4^n + 1.at n=29A057302
• Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n.at n=20A074348
• Number of distinct n X 2 toroidal 0..4 arrays.at n=3A184285
• Number of distinct n X 4 toroidal 0..4 arrays.at n=1A184287
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays.at n=11A184288
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays.at n=13A184288
• Odd numbers k > 1 such that A309906(k-1) < A309906(k) > A309906(k+1) < A309906(k+2) > A309906(k+3).at n=7A349938
• Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1).at n=38A349941