69133

Appears in sequences

• a(n) = (n+2)*a(n-1) + a(n-2), with a(0)=0, a(1)=1.at n=7A058308
• Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0, 1, 1, 3, 10, 43, 225, 1393, 9976, 81201, ... Then S(0), S(1), S(2), ... are written vertically, next to each other, with the initial term of each on the next row down.at n=48A102472
• Triangle read by rows. Let S(k) be the sequence defined by F(0)=0, F(1)=1, F(n-1) + (n+k)*F(n) = F(n+1). E.g. S(0) = 0,1,1,3,10,43,225,1393,9976,81201, ... Then S(0), S(1), S(2), ... are written next to each other, vertically, with the initial term of each on the next row down. The order of the terms in the rows are then reversed.at n=51A102473
• Number of binary words of length n containing at least one subword 1001 and no subwords 10^{i}1 with i<2.at n=29A143282
• T(n,k) = 2*(K(n,2)*I(k,2) - (-1)^(n+k)*I(n,2)*K(k,2)), where I(n,x) and K(n,x) are Bessel functions; triangle read by rows for 0 <= k <= n.at n=58A246654
• Numbers k such that 33*10^k + 1 is prime.at n=30A271107
• Sequence of pairwise relatively prime numbers of class P_5 (see comment in A275246).at n=27A275249
• Number of subsets of {1..n} with all distinct lengths of maximal runs (increasing by 1).at n=20A384175