25792

Appears in sequences

• Number of connected vertex-transitive graphs with n nodes.at n=27A006800
• Expansion of cos(sin(x))/cos(x), even terms only.at n=5A009043
• a(n) = n*(n+1)*(5*n+1)/6.at n=30A033994
• Number of ways to place a non-attacking white and black bishop on n X n chessboard.at n=12A035288
• Number of ways to write n as sum of prime powers p^e such that e>0 and p does not divide n.at n=60A079412
• Where A007535 reaches a record.at n=42A098653
• Convolution triangle of A030266, which shifts left under self-COMPOSE.at n=58A125278
• G.f.: Product_{n>0} ((1+x^n)/(1-x^n))^n.at n=13A156616
• Number of 3Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=9A207026
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=8A208377
• Number of partitions of n into prime power parts (not including 1) that do not divide n.at n=61A300580
• Number of non-Hamiltonian labeled n-vertex graphs with loops.at n=5A326239
• a(1)=2, a(2)=3; a(n) is the smallest k > a(n-1) such that k + a(n-1) is a multiple of a(n-2).at n=27A328724
• G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies: [Sum_{n>=0} x^n/(1 - x^(n+1))]^4 = Sum_{n>=0} a(n)*x^n/(1 - x^(n+1))^4.at n=17A341375