23452

Appears in sequences

• T(2n,n), where T is the array defined in A024996.at n=7A026073
• a(n) = T(n,[ n/2 ]), where T is the array defined in A024996.at n=14A026078
• Number of points of L1 norm 3 in cubic lattice Z^n.at n=26A035597
• Coordination sequence for 26-dimensional cubic lattice.at n=3A035721
• Coordination sequence for lattice D*_26 (with edges defined by l_1 norm = 1).at n=3A035798
• (Terms in A029613)/2.at n=25A051435
• (Terms in A029627)/2.at n=37A051457
• a(n) = S2(n,3), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.at n=4A089666
• Integers are written in the form abcd...n where "a" means "At position a in this integer there is a digit b"; "b" means: "at position b there is a digit c"; "c" means: "at position c there is a digit d"; ... and "n" means nothing. No repetitions are allowed (like in the integer 111).at n=39A105958
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 1, a(2) = 2, a(3) = 3.at n=20A295723
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = -1, a(3) = 2.at n=21A295734
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = 2, a(3) = 1.at n=20A295850
• Greatest positive integer whose reversed (weakly decreasing) prime indices have weighted sum (A318283) equal to n.at n=49A359683