19515

Appears in sequences

• a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 1. Also a(n) = T(n,n-1), where T is the array defined in A026082.at n=8A026084
• Sum of the squares of the first n squarefree numbers.at n=29A111715
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=7A207302
• Number of n X 5 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=18A298914
• Number of nX3 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero.at n=16A301657
• Number of equivalence classes of binary words of length n for the subword 10110.at n=32A317669
• Irregular table: the n-th row polynomial is given by the formal power series expansion of Sum_{k >= 0} (1 + q)^(n*k + n^2)*Product_{j = 1..k} (1 - (1 + q)^(2*j-1)), n >= 1.at n=39A340882
• Consecutive states of the linear congruential pseudo-random number generator (31481*s+21139) mod 10^5 when started at s=1.at n=6A384341