54085

Appears in sequences

• a(n+3) = 2*a(n+2) + 3*a(n+1) - a(n); with a(1) = 1, a(2) = 4, a(3) = 10.at n=10A095127
• a(n) = Sum {k + j*m <= n} (k + j*m), with 0 < k,j,m <= n.at n=36A106847
• Start with 1 and repeatedly reverse the digits and add 42 to get the next term.at n=35A118075
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=8A150801
• Number of (n+2) X 3 binary arrays with no more than two of any consecutive three bits set in any row or column.at n=3A202464
• Number of (n+2)X6 binary arrays with no more than two of any consecutive three bits set in any row or column.at n=0A202467
• T(n,k) = Number of (n+2) X (k+2) binary arrays with no more than two of any consecutive three bits set in any row or column.at n=6A202471
• T(n,k) = Number of (n+2) X (k+2) binary arrays with no more than two of any consecutive three bits set in any row or column.at n=9A202471
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 505", based on the 5-celled von Neumann neighborhood.at n=40A272583
• Partition the decimal expansion of Pi into non-overlapping strings of length 10: 3141592653, 5897932384,..; a(n) is the position of the strings where digits are different from each other.at n=16A329368