24946

Appears in sequences

• Assume the conjectured terms of A105594 are the correct beginnings of the trajectories described in A003508. a(n) is a record length of b(n) iterations to arrive at the collected trajectories. This sequence cites the a(n)'s.at n=18A105600
• A symmetrical triangle of polynomial coefficients based on the Hermite polynomials with leading coefficient adjusted to one: p(x,n)=HermiteH[n,x]-HermiteH[0,x]+x^n*(HermiteH[n,1/x]-HermiteH[0,1/x]).at n=40A176064
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,1)-steps. L_n is the set of lattice paths of weight n that start at (0,0) and end on the horizontal axis and whose steps are of the following four kinds: a (1,0)-step with weight 1; a (1,0)-step with weight 2; a (1,1)-step with weight 2; a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=46A182880
• Number of nX4 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=6A239596
• T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=51A239599
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 531", based on the 5-celled von Neumann neighborhood.at n=29A272752
• a(n) is the number of distinct radii of circles passing through at least three points in a square grid of n X n points.at n=20A357301
• Number of integer compositions of n whose leaders of weakly increasing runs are distinct.at n=20A374632