30315

Appears in sequences

• a(n) = (2*n - 1)*(7*n^2 - 7*n + 6)/6.at n=23A063490
• a(n) = (2*n+1)*(2*n+3)*(2*n+5)/3.at n=21A162540
• Partial sums of A000132.at n=31A175360
• Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.at n=35A190894
• Number of primes of n base-3 digits such that each of the 3 digits (0, 1, 2) appears exactly a prime number of times.at n=13A217050
• Number of length n+2 0..4 arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=4A252173
• T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=32A252177
• Number of length 5+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=3A252181
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 393", based on the 5-celled von Neumann neighborhood.at n=37A271604
• Perimeters of more than one primitive 120-degree integer triangle.at n=22A350047
• Number of integer partitions of n whose length can be written as a nonnegative linear combination of the distinct parts.at n=39A367218
• Number of unordered pairs of partitions of n with the same number of parts.at n=21A387259