30261

Appears in sequences

• Odd numbers with exactly 4 distinct palindromic prime factors.at n=11A046406
• Numbers that define integer Heronian triangles [a(n), prime(a(n)), A068968(n)] with area A068969(n).at n=37A068967
• Number of polyiamonds with n cells that tile the plane.at n=15A071332
• Totally multiplicative sequence with a(p) = a(p-1) + 10 for prime p.at n=29A166707
• 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=33A190894
• Number of binary strings of length n+3 such that the smallest number whose binary representation is not visible in the string is 5.at n=15A261441
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 758", based on the 5-celled von Neumann neighborhood.at n=36A273490
• Row 5 of A277710: Positions of 5's in A264977; positions of 10's in A277330.at n=48A277715
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)^2, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A296246
• Numbers which are the product of two S-primes (A057948) in exactly three ways.at n=30A343828
• Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 2, 2, ..., n, n] into k nonempty submultisets, for 1 <= k <= 2n.at n=52A358710