20059

Appears in sequences

• Number of ways to partition n elements into pie slices of different sizes allowing the pie to be turned over.at n=36A032228
• Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=14A048131
• Difference between average of smallest prime greater than n^3 and largest prime less than (n+1)^3 and n-th pronic [=n(n+1)].at n=25A063036
• Records in A111267.at n=18A111268
• Sum of primes < n^2.at n=22A139562
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 0, 1), (1, 0, -1)}.at n=10A148322
• Numbers k such that 12321*2^k + 1 is prime.at n=28A180924
• Semiprimes in A007504 (the sum of first n primes).at n=24A189072
• Number of rooted identity trees with n nodes and exactly 8 subtrees from the root.at n=6A227812
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 541", based on the 5-celled von Neumann neighborhood.at n=26A272807
• a(0) = 0; for n>0, a(n) is the index of the last term in A109812 that is <= 2^n - 1.at n=12A352205
• Indices k where k/A109812(k) reaches a new high point.at n=10A352919