28159

Appears in sequences

• Number of 6 X n binary arrays with a path of adjacent 1's and no path of adjacent 0's from top row to bottom row.at n=2A069420
• Number of n X 3 binary arrays with a path of adjacent 1's and no path of adjacent 0's from top row to bottom row.at n=5A069423
• a(n) = n-th centered n-gonal number.at n=38A100119
• Number of partitions of n having no doubletons. By a doubleton in a partition we mean an occurrence of a part exactly twice (the partition [4,(3,3),2,2,2,(1,1)] of 18 has two doubletons, shown between parentheses).at n=44A116645
• A sequence of asymptotic density zeta(10) - 1, where zeta is the Riemann zeta function.at n=27A143036
• a(n) = 78*n^2 + 1.at n=19A158769
• Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX5 array.at n=2A219468
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array.at n=23A219471
• Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 3Xn array.at n=4A219473
• Number of length 3+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=22A250420
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood.at n=34A271248
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 397", based on the 5-celled von Neumann neighborhood.at n=17A281755
• Numbers k such that (17*10^k - 47)/3 is prime.at n=21A286177
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 609", based on the 5-celled von Neumann neighborhood.at n=14A289932
• Number of label-increasing forests with branching bounded by 3.at n=9A297196
• a(n) is the smallest k such that A307092(k) = n.at n=25A307074
• Triangle a(n, k) read by rows: coefficient triangle that gives Lucas powers and sums of Lucas powers.at n=53A317360
• a(n) = (A230624(n)-2)/4.at n=52A350607
• Zeroless analog of tetranacci numbers.at n=29A371916