40090

Appears in sequences

• Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.at n=35A057344
• Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.at n=36A057344
• Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.at n=37A057344
• Occurrences of most frequently occurring number in 1-to-n 5-dimensional multiplication table.at n=38A057344
• Numbers k that divide the average of prime(k) and prime(k+1).at n=8A066706
• Numbers k such that k divides prime(k) + prime(k+1).at n=14A066895
• Numbers k such that prime(k+1)^2 == prime(k)^2 (mod k).at n=36A067783
• Numbers n such that prime(n) == -7 (mod n).at n=18A092049
• Numbers k such that prime(k + 1) == 7 (mod k).at n=15A105421
• (1/4)*number of nonsquare rectangles with corners on an n X n grid of points.at n=22A122225
• Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).at n=37A178947
• Number of 3-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=26A187858
• Numbers k such that k!3 - 3^2 is prime, where k!3 = k!!! is a triple factorial number (A007661).at n=40A243078
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 217", based on the 5-celled von Neumann neighborhood.at n=38A270911
• Let G_n denote the planar graph defined in A358746 with the addition, if n is odd, of the circle containing the initial n points; sequence gives the number of regions in G_n.at n=22A370976