28749
domain: N
Appears in sequences
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).at n=50A035548
- a(n) = 21*n^2.at n=37A064762
- a(n) = 46*n^2 - 1.at n=24A158634
- Euler transform of Fibonacci numbers.at n=17A166861
- Floor(1/{(5+n^4)^(1/4)}), where {}=fractional part.at n=32A184629
- 0-sequence of reduction of (n^2+n+1) by x^2 -> x+1.at n=12A192299
- Numbers n such that A234519(n) = n.at n=49A234524
- Composite numbers which divide the concatenation of their prime factors, with multiplicity, in ascending order.at n=0A259047
- Regular triangle where T(n,k) is the number of multiset partitions of strongly normal multisets of size n into k blocks, where a multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities.at n=39A317449
- Composites k such that the concatenation of the prime factors of k, with multiplicity, in some order is divisible by k.at n=46A322843
- The five digits of a(n) and their four successive absolute first differences are all distinct.at n=13A365257
- The smallest composite number which divides the concatenation of its ascending ordered prime factors, with repetition, when written in base n.at n=8A371641