61165
domain: N
Appears in sequences
- Strong pseudoprimes to base 97.at n=26A020323
- Number of binary strings u of any length with property that length(u) + number of 0's in u <= n (only one of a string and its reversal are counted).at n=22A066067
- Number of permutations p from (1,2,3,...,n) to (1,2,3,...,n) such that 1/(1+p(1)) + 1/(2+p(2)) + ... + 1/(n+p(n)) is an integer.at n=13A073112
- Numbers k such that the difference between k-th prime and next prime is 70.at n=20A116493
- a(0)=1, a(1)=2 continued recursively a(n) = (n-1)*a(n-1) - a(n-2) if n is even and a(n) = a(n-1) - (n-2)*a(n-2) if n is odd.at n=23A122578
- Array read by antidiagonals: T(m,n) is the number of induced paths in the grid graph P_m X P_n.at n=49A360199
- Array read by antidiagonals: T(m,n) is the number of induced paths in the grid graph P_m X P_n.at n=50A360199