36301

Appears in sequences

• Bitriangular permutations.at n=7A006230
• Strong pseudoprimes to base 36.at n=30A020262
• Strong pseudoprimes to base 67.at n=17A020293
• Strong pseudoprimes to base 70.at n=23A020296
• Number of dyslexic rooted compound windmills with n nodes where any 2 submills extending from the same node are different.at n=16A032235
• Number of permutations of 1..n with i-7<=p(i)<=i+2.at n=10A179344
• Number of zero-sum -n..n arrays of 4 elements with first through third differences also in -n..n.at n=35A202512
• G.f. satisfies: A(x) = Sum_{n>=0} x^n * A(x)^n * Product_{k=0..n} k!.at n=5A219270
• a(n) = [x^n] (1 + x + x^3 + x^4)^n.at n=10A228960
• Euler pseudoprimes to base 6: composite integers such that abs(6^((n - 1)/2)) == 1 mod n.at n=32A262053
• Triangle read by rows: T(n,m) = Sum_{i=0..m} Stirling2(m+1,i+1)*(-1)^(m-i)*i^(n-m)*i!, for n >= 2, m = 1..n-1.at n=47A272644
• Triangle read by rows: T(n,m) = Sum_{i=0..m} Stirling2(m+1,i+1)*(-1)^(m-i)*i^(n-m)*i!, for n >= 2, m = 1..n-1.at n=52A272644
• Half of the height of the right trapezoidal gnomon (of the derivative of Y=X^5).at n=10A281999
• Triangle read by rows: chromatic invariant T(n,m) of the complete bipartite graph K_{m,n}.at n=39A291774
• Triangle read by rows: Trace of the Akiyama-Tanigawa algorithm for powers x^3.at n=36A371764
• E.g.f. A(x) satisfies A(x) = exp(x / (1 + x*A(x))) * (1 + x*A(x))^2.at n=5A380773
• Centered pentagonal numbers which are squarefree semiprimes.at n=43A381043
• Centered pentagonal numbers which are semiprimes.at n=44A382132