37635

Appears in sequences

• a(n) = (n^2 - 1)*(n^2 - 3).at n=14A033596
• Squarefree numbers k with largest prime factor = floor(sqrt(k)).at n=32A071311
• 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, -1), (-1, -1, 0), (-1, -1, 1), (0, 1, 0), (1, 1, 0)}.at n=9A150044
• The Wiener index of the windmill graph D(6,n). The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs).at n=38A180577
• Composite squarefree numbers n such that p(i)+3 divides n-3, where p(i) are the prime factors of n.at n=7A225713
• Sides of (Heronian) triangles where sides are consecutive integers and area is an integer.at n=23A242497
• Number of (n+2)X(4+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=2A262846
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=17A262849
• Number of (3+2)X(n+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.at n=3A262852
• Expansion of Product_{k>=1} (1 + x^(2*k-1))^k.at n=41A263140
• Variation on Fermat's Diophantine m-tuple: 1 + the GCD of any two distinct terms is a square.at n=23A274697
• Largest side lengths of almost-equilateral Heronian triangles.at n=7A335025
• Starts of runs of 3 consecutive anti-tau numbers (A046642).at n=41A341780
• Numbers m such that abs(K(m+1) - K(m)) = 1, where K(m) = A002034(m) is the Kempner function.at n=30A346211
• Numbers k such that A353802(k) / sigma(sigma(k)) is an integer > 1, where A353802(n) = Product_{p^e||n} sigma(sigma(p^e)).at n=22A353807
• Numbers k such that A011776(k) = A011776(k+1).at n=18A373725
• Harmonic mean of the primes with n decimal digits, rounded to nearest integer.at n=4A388421