67788

Appears in sequences

• Sorted number reached from A033863(n) by Sort-then-add.at n=14A033864
• Sorted number reached from A033863(n) by Sort-then-add.at n=15A033864
• Sorted number reached from A033863(n) by Sort-then-add.at n=16A033864
• Sorted number reached from A033863(n) by Sort-then-add.at n=17A033864
• Number of positive integers <= 2^n of form 7 x^2 + 10 y^2.at n=20A054189
• Riordan array (1/(1-3x),x(1-x)/(1-3x)^2).at n=39A114195
• Number of multi-trace BPS operators for the quiver gauge theory of the orbifold C^2/Z_2.at n=12A120844
• Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=19A146921
• Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 2,2 3,1 3,2 4,1 5,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155437
• Number of nXnXn triangular 0..7 arrays with some element plus some adjacent element totalling 7+1 or 7-1 exactly once.at n=2A270605
• T(n,k)=Number of nXnXn triangular 0..k arrays with some element plus some adjacent element totalling k+1 or k-1 exactly once.at n=38A270606
• Number of 3X3X3 triangular 0..n arrays with some element plus some adjacent element totalling n+1 or n-1 exactly once.at n=6A270608
• a(0) = 0, and for n > 0, (a(n)) gives the indices n for which d(n) > d(k) for k < n, where d is the difference sequence of (cos k + sin k).at n=25A299639
• Sum T(n,k) of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts that form a set of size k; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.at n=29A327803
• Number of partitions of n that contain at least one odd prime as a part.at n=44A355193
• a(n) = Sum_{k=0..n} k^(n+k).at n=4A368492
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 + x*log(1-x))^2 ).at n=6A376385