24370
domain: N
Appears in sequences
- 1 + Sum_{n>=1} a_n x^n = Product_{n>=1} (1-x^n)^prime(n).at n=30A007441
- Numbers k such that the continued fraction for sqrt(k) has period 47.at n=30A020386
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 9.at n=38A031422
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals prime(n).at n=34A070901
- a(1) = a(2) = a(3) = 1; for n>3, a(n) = a(n-1) + a(n-2) + a(n-3) iff n-1 is prime, otherwise a(n) = a(n-1) + 1.at n=32A113057
- Number of moduli m such that the multiplicative order of n mod m equals n.at n=29A252760
- Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having directed index change 1,0 0,-1 1,2 or -1,1.at n=5A264580
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 1,0 0,-1 1,2 or -1,1.at n=50A264583
- Number of (6+1)X(n+1) arrays of permutations of 0..n*7+6 with each element having directed index change 1,0 0,-1 1,2 or -1,1.at n=4A264589
- Regular triangle read by rows where T(n,k) is the number of set partitions of {1,...,n} with k topologically connected components.at n=57A324173
- Total number of parts coprime to n in the partitions of n into 8 parts.at n=43A363326
- Number of pairs of adjacent equal parts in all gap-free compositions of n.at n=15A380176