2270268000

Appears in sequences

• State assignments for n-state machine.at n=11A006845
• Number of permutations of {1,2,3,...,n} where the elements of n are considered indistinguishable if they differ by a power of 2 (for example 3, 12 and 24 are all considered equivalent).at n=15A067281
• a(n) = core(1)*core(2)*...*core(n) where core(n) is the squarefree part of n (A007913).at n=14A069260
• a(n) = core(1)*core(2)*...*core(n) where core(n) is the squarefree part of n (A007913).at n=15A069260
• a(1) = 1, a(n) = a(n-1) times largest nontrivial divisor if n is composite.at n=14A072487
• Triangle, read by rows, where T(n,k) = n!/(k!*(n-4*k)!*4^k) for n>=4*k>=0.at n=43A118933
• Triangle read by rows: T(m,l) = number of labeled covers of size l of a finite set of m unlabeled elements (m >= 1, 1 <= l <= 2^m - 1).at n=21A133709
• a(n) = A203309(n+1)/A203309(n).at n=7A203310
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=33A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=34A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=35A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=36A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=37A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=38A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=39A368901
• The least common multiple of the first n terms of Doudna sequence, A005940.at n=40A368901