29503

Appears in sequences

• Number of connected graphs with n edges.at n=12A002905
• Number of connected line graphs with n nodes.at n=11A003089
• a(n) = floor(3rd elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=18A025213
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 31 ones.at n=8A031799
• a(n) is the smallest composite number c such that A002110(n) + c is prime.at n=37A038771
• n-th 4k+1 prime times (n+1)st 4k+3 prime.at n=18A048628
• Records in A007535.at n=40A098654
• Semiprimes in A056108.at n=30A113527
• A triangular array of numbers related to factorization and number of parts in Murasaki diagrams.at n=61A133611
• 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, 0, 0), (0, 1, -1), (0, 1, 1), (1, -1, -1)}.at n=10A148602
• Number of nonnegative integer arrays of length n+5 with new values 0 upwards introduced in order, and containing the value 5.at n=4A211559
• T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1.at n=49A211561
• Number of nonnegative integer arrays of length n+4 with new values 0 upwards introduced in order, and containing the value n-1.at n=5A211564
• Row sums of A047997.at n=10A212352
• Sequence of pairwise relatively prime numbers of class P_8 (see comment in A275246).at n=20A275253
• Triangle read by rows: T(n,k) = number of graphs with n edges and k connected components.at n=66A275421
• Numbers such that the sum of the reverse of their aliquot parts is equal to the reverse of the sum of their aliquot parts.at n=36A278948
• Number of rooted trees with n nodes such that six equals the maximal number of subtrees of the same size extending from the same node.at n=12A318821
• Number of rooted trees with n nodes such that six equals the maximal number of isomorphic subtrees extending from the same node.at n=12A318863
• Number T(n,k) of entries in the k-th blocks of all set partitions of [n] when blocks are ordered by decreasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=50A319375