117649

Appears in sequences

• Number of labeled rooted trees with n nodes: n^(n-1).at n=6A000169
• Powers of 7: a(n) = 7^n.at n=6A000420
• Sixth powers: a(n) = n^6.at n=7A001014
• Numbers of the form 3^i*7^j with i, j >= 0.at n=40A003594
• Numbers of the form 5^i*7^j with i, j >= 0.at n=29A003595
• Numbers of the form 7^i*11^j.at n=20A003599
• Numbers that are the sum of at most 2 nonzero 6th powers.at n=28A004853
• Triangle read by rows: T(n,k) is the number of partially labeled rooted trees with n vertices, k of which are labeled, 0 <= k <= n.at n=34A008295
• Triangle read by rows: T(n,k) is the number of partially labeled rooted trees with n vertices, k of which are labeled, 0 <= k <= n.at n=35A008295
• a(n) = Product_{j=0..5} floor((n+j)/6).at n=42A008881
• Triangle of coefficients in expansion of (1+7x)^n.at n=27A013614
• Triangle of coefficients in expansion of (2 + 7*x)^n.at n=27A013623
• Triangle of coefficients in expansion of (3+7x)^n.at n=27A013624
• Triangle of coefficients in expansion of (4+7x)^n.at n=27A013625
• Triangle of coefficients in expansion of (5+7x)^n.at n=27A013626
• Triangle of coefficients in expansion of (6+7x)^n.at n=27A013627
• a(n) = 7^(5*n + 1).at n=1A013842
• a(n) = (F(n+1) + L(n))^2 where F(n) are the Fibonacci numbers (A000045) and L(n) are the Lucas numbers (A000032).at n=11A014717
• Numbers k that divide 8^k - 1.at n=13A014949
• Numbers k such that k | 6^k + 1.at n=18A015953