25785

Appears in sequences

• Numbers k such that 189*2^k+1 is prime.at n=26A032471
• Numbers n such that h(n) = 3 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)at n=30A078420
• McKay-Thompson series of class 24g for the Monster group.at n=59A112164
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=floor(n/2)).at n=51A114486
• Number of n X 2 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=6A183547
• Number of nX7 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=1A183552
• T(n,k)=Number of nXk 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=29A183554
• T(n,k)=Number of nXk 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=34A183554
• Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 8 as largest digit.at n=38A257368
• Least n-gonal number greater than 1 such that sigma(n) is also n-gonal.at n=25A259240
• Sum of the largest parts of the partitions of n into 9 parts.at n=37A326473
• Number of ways to write n as a nonnegative linear combination of a strict integer partition.at n=24A365002