20895

Appears in sequences

• Centered tetrahedral numbers.at n=31A005894
• In the '3x+1' problem, these values for the starting value set new records for highest point of trajectory before reaching 1.at n=14A006884
• Initial number for record sum of numbers in trajectory of 3x+1 problem.at n=32A033495
• Number of labeled rooted polygonal cacti (Husimi graphs) with n nodes.at n=6A035087
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=2A084277
• a(n) is the smallest number having n as the largest number of distinct prime factors of any term in its 3x+1 trajectory.at n=6A087975
• Least number whose Collatz 3x+1 trajectory contains a number >= 2^n.at n=25A222292
• Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 1, m + 3, m + 5, where m == 2 (mod 4).at n=17A243580
• Triangle read by rows: T(n, k) = (-1)^(n - k) * binomial(2n + 1, n - k) * L(2k + 1), 0 <= k <= n, where L(k) is the k-th Lucas number (A000032).at n=33A326832
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.at n=13A360215
• Expansion of Product_{k>=1} (1 + x^k) * (1 + x^(k^2)) * (1 + x^(k^3)).at n=44A369575