32504

Appears in sequences

• Binomial transform of tribonacci numbers.at n=11A073357
• Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.at n=15A110351
• Binomial transform of A079261.at n=16A143982
• Eigensequence of A047999, Sierpinski's gasket.at n=19A166966
• Partial sums of A078902.at n=7A172521
• Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,3,4,1 for x=0,1,2,3,4.at n=22A196205
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 737", based on the 5-celled von Neumann neighborhood.at n=28A273480
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=28A287598
• a(0) = a(1) = 1; a(n+2) = Sum_{k=0..n} (binomial(n,k) mod 2) * a(k).at n=40A331520
• Number of subsets of {1..n} containing n such that it is not possible to choose a different prime factor of each element (non-choosable).at n=16A370587