60615

Appears in sequences

• Let S denote the palindromes in the language {0,1,2}*; a(n) = number of words of length n in the language SS.at n=14A007056
• Numbers k such that 245*2^k+1 is prime.at n=28A032499
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, -1), (0, 1, 1), (1, -1, -1)}.at n=11A148537
• Least positive integer m relatively prime to n such that sigma(m*n) is a fourth power, where sigma(k) is the sum of the divisors of k.at n=55A334353
• Irregular triangle read by rows. For each j, 1<=j<=n properly color the vertices of a labeled graph on [n] using each of the first j colors in the color set {c1<c2<...<cn}. Orient the edges according to the strict order on the colors. T(n,k) is the number of such directed graphs containing k descents, n>=0, 0<=k<=binomial(n,2).at n=16A381102