18907

Appears in sequences

• Numbers k such that 39*2^k + 1 is prime.at n=43A002269
• a(n) = p^2 + p + 1 where p runs through the primes.at n=32A060800
• Numbers in ascending order formed by using all the digits of the next n numbers.at n=25A081991
• Numbers which are the sum of two positive cubes and divisible by 37.at n=23A102618
• Period of the Lucas 3-step sequence A001644 mod prime(n).at n=32A106294
• Period of the Fibonacci 3-step sequence A000073 mod prime(n).at n=32A106302
• Reduced period of the Fibonacci 3-step sequence A000073 mod prime(n).at n=32A154753
• Number of nodes (or order) of a graph model obtained using an automata scheme on sets of order prime(n) >= 5 and in which all not halt states are linked by arcs (edges).at n=31A160772
• 7 times hexagonal numbers: a(n) = 7*n*(2*n-1).at n=37A195320
• Numbers arising in computing the Turan function of cycles of length 4.at n=36A217004
• Maximally idempotent integers with three or more factors.at n=31A306812
• Number of set partitions of {1, 2, ..., n} such that, for any two numbers in the same part, one divides the other.at n=16A333517
• a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).at n=34A353150