885735

Appears in sequences

• Numbers that are the sum of 5 positive 11th powers.at n=20A004816
• a(n) = 5*3^n.at n=11A005030
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*9^j.at n=25A038227
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*3^j.at n=23A038293
• Let S(t) = 1 + s_1*t + s_2*t^2 + ... satisfy S' = -S/(2 + S); sequence gives denominators of s_n.at n=6A058956
• 9th binomial transform of (1,1,0,0,0,0,0,...).at n=6A081109
• 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=25A083658
• Maximum of odd products of partitions of n.at n=38A091916
• Triangle T, read by rows, where matrix power T^3 has powers of 3 in the secondary diagonal: [T^3](n+1,n) = 3^(n+1), with all 1's in the main diagonal and zeros elsewhere.at n=24A117252
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k leaves (i.e., vertices of degree 0; n>=0, k>=1). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=38A120429
• a(n) = (1/2)*n*(n-1)*3^(n-1).at n=10A129530
• Smallest odd n-almost prime m such that m-2 and m+2 are both prime (cousin primes).at n=11A145031
• a(n) = 3*a(n-2) for n > 2; a(1) = 5, a(2) = 3.at n=22A162813
• a(n) = 3*a(n-2) for n > 2; a(1) = 1, a(2) = 5.at n=23A166465
• G.f.: (1+x+x^2+2*x^5-2*x^10)/(1-3*x^3).at n=38A213933
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=41A272818
• Numbers m such that Product(1 + p_i) = Product(1 + e_i), where m = Product((p_i)^e_i).at n=47A272858
• Odd exceptional numbers: odd k such that A005179(k) < A037019(k).at n=36A331613
• Odd numbers k such that rad(k) divides sigma(k).at n=38A336554
• a(n) is the least positive number k such that 3^n+k has n prime factors counted with multiplicity.at n=21A337219