35568

Appears in sequences

• Number of positive integers <= 2^n of form x^2 + 2 y^2.at n=17A000067
• Product of all n - d, where d < n and d is a divisor of n.at n=38A072513
• Denominators of expansion of 1/x+1/log(1-x).at n=37A075178
• a(n) = n*(2*n^2 + 5*n + 15)/2.at n=32A163673
• Iterative mapping: a(1)=0, a(n)=A179216(a(n-1)).at n=12A179221
• Triangular array read by rows. T(n,k) is the number of sets of exactly k distinct binary words with a total of n letters.at n=43A208741
• Terms of A007504 divisible by 3.at n=37A249679
• Number of nX5 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nonincreasing.at n=17A266544
• Number of n X 3 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=6A297333
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=42A297338
• Number of 7Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0 or 2 neighboring 1s.at n=2A297344
• a(n) = n*(2*n - 3 - (-1)^n)*(5*n - 2 + (-1)^n)/16.at n=38A308025
• Number T(n,k) of labeled cyclic chord diagrams having n chords and minimal chord length k (or k=0 if n=0); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=40A324429
• Number of labeled cyclic chord diagrams with n chords such that the minimal chord length equals four.at n=4A324448
• Dirichlet g.f.: (zeta(s-3) / zeta(s))^2.at n=20A338165
• G.f. A(x) satisfies A(x) = 1 / (1 - x - x * A(x^2)).at n=12A349365
• Pisano period of Hexanacci numbers (A001592) mod n.at n=34A381508