23384

Appears in sequences

• Number of cyclically-5-connected planar trivalent graphs with 2n nodes.at n=13A006791
• a(n) = [ 1/(2*t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(Pi/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1.at n=23A024817
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=24A031785
• Numbers of planar triangulations with minimum degree 5 and without separating 3- or 4-cycles - that is 3- or 4-cycles where the interior and exterior contain at least one vertex.at n=13A111358
• Consider the 2^n values of A139250(i)/i^2 for 2^n <= i < 2^(n+1); a(n) = value of i where this quantity is minimized.at n=14A170927
• Number of partitions of n with difference 1 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=45A242692
• Number of even parts in the partitions of n into 7 parts.at n=48A309625
• Number of separable partitions of n that consist of an odd number of parts.at n=42A325724
• Number of words of length 2n+1 with one 0 entry and two entries of each of 1..n so that there are exactly k numbers between two equal k's and so that the first element does not exceed the last.at n=9A381759
• Number of words of length 2n+1 with one 0 entry and two entries of each of 1..n so that there are exactly k numbers between two equal k's and so that the first element is not 0 and also does not exceed the last.at n=9A381760