19256

Appears in sequences

• Iterates of A122237, starting from 4.at n=7A122241
• Number of permutations of 0..n-1 with all sums of 3 adjacent terms unique.at n=7A152314
• Number of permutations of floor(i*9/8), i=0..n-1, with all sums of 3 adjacent terms unique.at n=7A152331
• Partial sums of A033485.at n=39A178855
• Numbers k such that k^2 + 1 = p*q, p and q primes and |p-q| is square.at n=33A187401
• Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=10A207584
• Rising diagonal sums of triangle of Fibonacci polynomials (rows displayed as centered text).at n=20A227300
• Number of binary strings of length 2n that contain the ones' complements and the reversals of each of their two halves.at n=20A237502
• The number of P-positions in the game of Nim with up to five piles, allowing for piles of zero, such that the total number of objects in all piles doesn't exceed 2n.at n=15A238147
• a(n) = number of new distinct proper angles with vertex and legs on grid points in an n X n square grid that were not found in an (n-1) X (n-1) square grid.at n=33A252592
• Number of multisets of nonempty words with a total of n letters over nonary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=10A293739
• Total runs-resistance of all binary vectors of length n.at n=11A319415
• Number of quadrilaterals in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=19A332607
• Irregular triangle read by rows: consider the structure formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of an (n+1) X 3 rectangular grid of points (or equally, an n X 2 grid of squares); row n gives number of cells with k sides, for k >= 3.at n=72A335701
• Total number of modes in all partitions of n.at n=35A372542