26133
domain: N
Appears in sequences
- a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=31A004949
- Numerator of b(n) = Sum_{k'<=n} 1/k', where k' denotes the squarefree numbers.at n=12A072980
- Number of Frobenius equivalence classes of size n over GF(2^n) with their trace equal to the trace of their inverse.at n=18A137503
- 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, 0, 0), (0, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=9A149184
- Number of ways to place 4 nonattacking knights on an n X n board.at n=5A172135
- a(n) = Sum_{k=0..n} k*A002893(k).at n=5A207323
- Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows.at n=41A244081
- a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence.at n=44A331503
- a(n) is the numerator of the sum of the reciprocals of the first n squarefree numbers.at n=8A354417
- G.f. A(x) satisfies A(x) = (1 + x*A(x)/(1 - x*A(x))^3)^2.at n=6A365135