27365

Appears in sequences

• Number of n-celled polyknights with bilateral symmetry.at n=10A030447
• Number of positive integers <= 10^n that are divisible by no prime exceeding 13.at n=9A106629
• The i-th term of the generalized Fibonacci sequence [0,k,k,2k,3k,...] is given by the formula F(i) = round( k/sqrt(5) * phi^i ) provided i >= s(k); a(n) = smallest value of k such that s(k) = n.at n=20A111917
• Symmetric triangle, read by rows of 2*n+1 terms, similar to triangle A008301. Second term 5 times first term.at n=17A126155
• Symmetric triangle, read by rows of 2*n+1 terms, similar to triangle A008301. Second term 5 times first term.at n=23A126155
• Number of n X 2 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=20A163685
• Numerators of A178381(4*n+1)/A178381(4*n).at n=10A179131
• Equals one maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nX3 array.at n=4A220914
• T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array.at n=25A220916
• a(n) is the smallest k such that 2^(2^n) - 2^k - 1 is prime, or -1 if no such k exists.at n=14A232565
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=34A270327
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k*x)*(sec(x) + tan(x)).at n=62A292975
• Expansion of e.g.f. exp(3*x)*(sec(x) + tan(x)).at n=7A307878
• Number of integer partitions of n with integer median of 0-appended first differences.at n=38A360688