55575

Appears in sequences

• 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=25A001296
• Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=37A002414
• Least sum of 4 distinct positive cubes in exactly n ways.at n=10A025421
• Numbers having four 5's in base 10.at n=30A043512
• Numbers k such that 11^k == -1 (mod k-1).at n=15A055694
• Partial sum of usigma is divisible by n, where usigma(n) = A034448(n) and summatory-usigma(n) = A064609(n).at n=13A064611
• a(n) = n*(n+1)*(n^2+1)/2.at n=18A071237
• Terms in A046034 which are pairwise products of terms in A046034.at n=37A153446
• Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=3A162871
• Number of 0..n arrays x(0..3) of 4 elements with each no smaller than the sum of its two previous neighbors modulo (n+1).at n=23A207101
• Odd octagonal pyramidal numbers.at n=19A218326
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 597", based on the 5-celled von Neumann neighborhood.at n=37A273146
• Number of Motzkin prefixes of length 2n and height n.at n=7A283667
• Numbers k with digits 5 and 7 only.at n=32A284380
• a(n) = (1/24)*n*(n - 1)*(n - 3)*(n - 14).at n=39A319930
• One of the two successive approximations up to 2^n for 2-adic integer sqrt(17). This is the 3 (mod 4) case.at n=14A341539
• One of the two successive approximations up to 2^n for 2-adic integer sqrt(17). This is the 3 (mod 4) case.at n=15A341539
• One of the two successive approximations up to 2^n for 2-adic integer sqrt(17). This is the 3 (mod 4) case.at n=16A341539
• Numbers that are the sum of four third powers in nine or more ways.at n=18A345146
• Numbers that are the sum of four third powers in ten or more ways.at n=8A345155