28831
domain: N
Appears in sequences
- a(n) is the number of partitions of 4n that can be obtained by adding together four (not necessarily distinct) partitions of n.at n=10A002221
- a(n) = A064835(n)/2.at n=22A064836
- a(n) = Sum_{d|n} phi(d^3).at n=30A068963
- Number of UFU-free Motzkin paths of length n.at n=13A095980
- a(n) = n^3 - n^2 + 1.at n=31A100104
- n times pi(n) is a palindrome, where pi(n) = PrimePi(n) = A000720(n).at n=32A116054
- a(n) = 961*n + 1.at n=29A158414
- a(n) = 30*n^2 + 1.at n=31A158558
- Number of values of k for which sigma(k) is a permutation of decimal digits of k, for 10^(n-1) < k < 10^n.at n=8A216390
- Coefficient of x^2 in minimal polynomial of the continued fraction [1^n,5,1,1,1,...], where 1^n means n ones.at n=9A265804
- Records in A352187.at n=55A352191
- Number of distinct residues of x^n (mod n^4), x=0..n^4-1.at n=30A365101