19019

Appears in sequences

• Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=38A000330
• a(n) = 13*binomial(2n,n-6)/(n+7).at n=5A000590
• a(n) = (12*n+1)*(12*n+11).at n=11A001538
• a(n) is the number of Dyck paths of semilength n+6 having its first peak at height n+1.at n=12A005557
• Odd square pyramidal numbers.at n=19A015221
• Expansion of 1/((1-x)*(1-3*x)*(1-4*x)*(1-9*x)).at n=4A021379
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor(n/2), s = (odd natural numbers).at n=37A025112
• Divisors of 10^9 + 1.at n=15A027901
• Distinct odd numbers in (2,3)-Pascal triangle A029600.at n=51A029608
• Odd numbers to the left of the central elements of the (2,3)-Pascal triangle A029600.at n=34A029612
• Numbers to right of central elements of the (3,2)-Pascal triangle A029618 that are different from 2.at n=50A029633
• Odd numbers to right of central elements of the (3,2)-Pascal triangle A029618.at n=30A029634
• a(n) = f(n,n) where f is given in A034261.at n=7A034267
• Partial sums of A051798.at n=10A051879
• a(n) = (8*n+9)*C(n+8,8)/9.at n=6A056122
• Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.at n=37A059774
• n repeated in decimal representation, but separated by enough zeros that the square has the pattern (n^2)(2n^2)(n^2).at n=18A077431
• Numbers whose name in American English is a word-palindrome, reading the same forward and backward.at n=27A081365
• Numbers whose set of base 12 digits is {0,B}, where B base 12 = 11 base 10.at n=9A097258
• Sequence and first differences include all square numbers exactly once.at n=37A109678