24837
domain: N
Appears in sequences
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=41A023862
- a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=40A023870
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=29A157116
- Number of n X 4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,2,3,0,4 for x=0,1,2,3,4.at n=6A196574
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,2,3,0,4 for x=0,1,2,3,4.at n=3A196577
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,2,3,0,4 for x=0,1,2,3,4.at n=48A196578
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,2,3,0,4 for x=0,1,2,3,4.at n=51A196578
- Sum of the fourth largest parts of the partitions of n into 10 parts.at n=43A326595