19552
domain: N
Appears in sequences
- Total length of strings on n symbols in Stockhausen problem.at n=3A008270
- a(n+1) = a(n) converted to base 7 from base 2 (written in base 10).at n=3A023364
- Sums of 4 distinct powers of 7.at n=12A038483
- Number of primes of the form 8k+1 less than 10^n.at n=5A091126
- Number of partitions of n with parts occurring at most thrice and an even number of parts. Row sums of A098489.at n=48A098491
- Number of partitions of n with parts occurring at most thrice and an odd number of parts. Row sums of A098490.at n=48A098492
- Number of partitions of {1,..,n} in which no part of a given size occurs just once.at n=10A114917
- Triangle of coefficients of the Pollaczek polynomials with a=1, b=1 multiplied by n! to make then integers.at n=21A136454
- Number of reduced words of length n in the Weyl group B_48.at n=3A162193
- Number of reduced words of length n in the Weyl group D_48.at n=3A162461
- Smallest positive multiple of n whose base-7 representation contains only 0's and 1's.at n=25A244958
- The second Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.2).at n=16A292345
- a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(2*j*k) / phi(k).at n=30A372664