22575

Appears in sequences

• Numbers k that divide s(k), where s(1)=1, s(j)=21*s(j-1)+j.at n=40A014872
• Closed 3-dimensional ball numbers (version 1): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (0,0,0).at n=35A053591
• Open 3-dimensional ball numbers (version 1): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (0,0,0).at n=35A053592
• a(n) = sum_{k=1..n} prime(k)*prime(k+1).at n=17A074745
• Number of permutations of n distinct letters (ABCD...) each of which appears 5 times and having n-2 fixed points.at n=42A123296
• Triangle in A144643 read by columns downwards.at n=61A144644
• Triangle in A144643 read upwards by columns.at n=59A144645
• Terms in A046034 which are pairwise products of terms in A046034.at n=18A153446
• Triangle T(n,k,p,q) = (p^n + q^n)*A001263(n, k) with p=2 and q=1, read by rows.at n=24A155537
• Number of ballot sequences of length n having exactly one descent.at n=13A241794
• a(n) = 3*(3*n+1)*(9*n+8)/2.at n=23A304504
• Numbers k such that k and k+1 are both phi-practical numbers (A260653).at n=26A330871
• a(n) = A351477(n) * FC where F is the Fermat point of a primitive integer-sided triangle ABC with A < B < C < 2*Pi/3 and FA + FB + FC = A336329(n).at n=39A351803
• The smallest number in base n such that two digits (and no fewer) need to be changed to get a prime.at n=33A370531
• Triangle read by rows: T(n,k) is the number of regions between the free polyominoes, with n cells and length k, and their bounding boxes, n >= 1, k >= 1.at n=60A380284