18696

Appears in sequences

• Sum of largest parts (counted with multiplicity) of all partitions of n into odd parts.at n=39A092310
• Numbers such that Sigma(m)*UnitarySigma(m)= k*UnitaryPhi(m)^2, for some integer k.at n=39A122839
• Number of base 28 n-digit numbers with adjacent digits differing by one or less.at n=7A126382
• a(n) = 2*A001610(n).at n=18A168674
• Number of n X 7 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=26A188864
• Number of Hamiltonian cycles in the generalized Petersen Graph P(n,2).at n=35A195197
• Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w^2>x^2+y^2.at n=21A211631
• Number of highly irregular connected graphs with n nodes.at n=14A217246
• Area A of the cyclic quadrilaterals PQRS with PQ>=QR>=RS>=SP, such that A, the sides, the radius of the circumcircle and the two diagonals are integers.at n=27A219225
• a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=54A261227
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 838", based on the 5-celled von Neumann neighborhood.at n=43A273681
• p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S^2 - S^3.at n=15A291398
• a(0)=1; a(1)=1; for n >= 2, a(n) = a(n-A000120(n)) + a(n-1-A023416(n)).at n=37A297216
• Number of 6-cycles in the n-polygon diagonal intersection graph.at n=21A300554
• The number of Hamiltonian cycles in the concentric ring graph of order n.at n=16A384294