179196

Appears in sequences

• a(n) = 1^n + 2^n + 3^n.at n=11A001550
• Numbers that are the sum of 6 positive 10th powers.at n=20A004806
• Numbers that are the sum of 3 positive 11th powers.at n=5A004814
• Numbers that are the sum of at most 3 positive 11th powers.at n=14A004909
• Numbers that are the sum of at most 4 positive 11th powers.at n=20A004910
• Numbers that are the sum of at most 5 positive 11th powers.at n=27A004911
• Numbers that are the sum of at most 6 positive 11th powers.at n=35A004912
• Consider 3 X 3 X 3 Rubik cube, but only allow the squares group to act; sequence gives number of positions that are exactly n moves from the start.at n=11A080627
• Sum of first n 11th powers.at n=3A123095
• Rectangular array read by rows: T(n,k) is the number of words of length n on alphabet {0,1,2} that have exactly k records, n>=0, 0<=k<=3.at n=49A285852
• a(n) = least number > 1 that equals the sum of the n-th powers of its first k divisors for some k.at n=10A318528
• a(n) is the next number after a(n-1) which cannot be represented in the form 2*a(i) and Sum_{j=1..n-1} b_j*a(j) where 0 < i < n, b_j = 1 or 0. The sequence starts: a(1) = 1; a(2) = 2; a(3) = 3; a(4) = 5.at n=21A331811
• a(n) = Sum_{k=0..floor(n/3)} k^n.at n=11A352982