30833

Appears in sequences

• Starting with a(0) = 1, smallest squarefree number k such that, for all a(m), m < n, k + a(m) is not squarefree.at n=13A077225
• Starting with a(0) = 1, smallest number k > a(n-1) such that, for all a(m) with m < n, k + a(m) is not squarefree.at n=15A080793
• Number of n-bead necklaces labeled with numbers -1..1 not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=14A209108
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 382", based on the 5-celled von Neumann neighborhood.at n=41A271541
• Triangle read by rows: T(n,k) is the number of set partitions of {1..3n} into n sets of 3 with k disjoint strings of adjacent sets, each being a contiguous set of elements.at n=24A334060