46684
domain: N
Appears in sequences
- Aliquot sequence starting at 660.at n=12A014362
- Numbers that are the sum of 3 positive cubes in exactly 3 ways.at n=37A025397
- Numbers that are the sum of 3 distinct positive cubes in exactly 3 ways.at n=32A025401
- Numbers that are the sum of 3 distinct positive cubes in 3 or more ways.at n=35A025402
- Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to 3 4 5 6 7 8 or 9.at n=2A251500
- Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock summing to 3 4 5 6 7 8 or 9.at n=0A251502
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 3 4 5 6 7 8 or 9.at n=3A251507
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 3 4 5 6 7 8 or 9.at n=5A251507
- a(1) = 2; for n > 1, a(n) is the least positive number not yet in the sequence such that Sum_{k=1..n} a(k) divides Sum_{k=1..n} a(k)^2.at n=47A318358
- a(n) = Sum_{k=0..floor(n/3)} (n-3*k)^(n-3*k).at n=6A353018
- Expansion of Sum_{k>0} (x * (k + x^k))^k.at n=5A360770