30070

Appears in sequences

• Tumbling distance for n-input mappings with 3 steps.at n=5A005948
• Number of primitive (period n) bracelet structures using a maximum of four different colored beads.at n=12A056363
• Sum of the first n n-digit primes less n*10^(n-1).at n=27A114053
• Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 10 all are equal.at n=27A135120
• a(n) = a(n-1)*2 + floor(sqrt(a(n-2))).at n=15A182557
• The Gi1 and Gi2 sums of Losanitsch's triangle A034851.at n=36A192928
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=34A214025
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=36A214037
• Number of partitions of n such that either both floor(n/2) and ceiling(n/2) are parts or else neither is a part.at n=38A238624
• Number of compositions of n in which the maximal multiplicity of parts equals 7.at n=12A243124
• Growth series for group with presentation < S, T : S^3 = T^6 = (S*T)^6 = 1 >.at n=11A298806
• Expansion of Product_{k>0} theta_3(q^k), where theta_3() is the Jacobi theta function.at n=34A320067
• Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 1 and t = 132.at n=8A324130