35287
domain: N
Appears in sequences
- Complexity of doubled cycle (regarding case n = 2 as a multigraph).at n=6A006235
- Apply partial sum operator twice to Stern's sequence.at n=15A014172
- Complexity of doubled cycle (regarding case n = 2 as a graph).at n=6A072373
- Number of spanning trees in C_7 X P_n.at n=1A158898
- Number A(n,k) of spanning trees in C_k X P_n; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=29A173958
- Array read by antidiagonals: total number of spanning trees R_n(m) of the complete prism K_m X C_n.at n=29A175243
- Numbers n such that Sum_{i=1..n} (i')^i == 0 (mod n), where i' is the arithmetic derivative of i.at n=14A227848
- Number of strings of length n over a 7-letter alphabet that begin with a nontrivial palindrome.at n=6A249640
- Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = sqrt( Product_{a=1..n-1} Product_{b=1..k-1} (4*sin(a*Pi/n)^2 + 4*cos(b*Pi/k)^2) ).at n=51A340561
- E.g.f. satisfies log(A(x)) = (exp(x*A(x)) - 1) * x.at n=7A349560
- Numbers of the form p^2*q, with odd primes p > q, such that q divides p-1.at n=20A350638
- Numbers k such that sigma(k) = psi(k) + tau(k) + omega(k).at n=18A386637