35465

Appears in sequences

• a(n) = ceiling(n*phi^15), where phi is the golden ratio, A001622.at n=26A004970
• For n>0, a(n) is the least quasi-Carmichael number to base -n, extended to n=0 with the least composite squarefree integer.at n=31A029591
• a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).at n=32A058923
• Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1.at n=17A093371
• 3n^3 - 2n^2 + n - 1.at n=22A130885
• Numbers n such that 30n+{11, 13, 17, 19, 23} are 5 consecutive primes.at n=35A182279
• Number of (n+1) X 5 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=16A204647
• A122536(2n)/2.at n=8A211975
• The number of maximal subsemigroups of the Jones monoid on the set [1..n].at n=22A290140