98415
domain: N
Appears in sequences
- Numbers that are the sum of 5 positive 9th powers.at n=20A003394
- a(n) = 5*3^n.at n=9A005030
- Triangle of coefficients in expansion of (1+9x)^n.at n=25A013616
- Numbers whose prime factors are 3 and 5.at n=29A033849
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*9^j.at n=19A038227
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*9^j.at n=23A038227
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=23A038291
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*3^j.at n=16A038293
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*3^j.at n=25A038293
- Next-to-last diagonal of A024462.at n=10A038765
- Odd numbers divisible by exactly 10 primes (counted with multiplicity).at n=1A046323
- Let S(t) = 1 + s_1*t + s_2*t^2 + ... satisfy S' = -S/(2 + S); sequence gives denominators of s_n.at n=5A058956
- Number of divisors (A000005) of the Wonderful Demlo numbers A002477.at n=43A063750
- 9th binomial transform of (0,0,1,0,0,0,...).at n=6A081139
- a(n) = 3^n(n^2 - n + 18)/18.at n=9A081909
- a(n) = a(n-1) + a(n-2) + gcd(a(n-1), a(n-2)) for n > 1; a(0)=1, a(1)=1.at n=21A083658
- Maximum of odd products of partitions of n.at n=32A091916
- Array read by rows in which the n-th row contains smallest odd numbers in increasing order of all possible prime signatures with n divisors.at n=39A122819
- Square roots of the odd indexed terms of A038547.at n=28A122842
- Number of 4-ary Lyndon words of length n with exactly two 1s.at n=8A124810