43470

Appears in sequences

• Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=34A002414
• a(n) = 18*(n - 2)*(2*n - 5).at n=35A060787
• Square array read by antidiagonals of number of length 2k walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.at n=50A064045
• a(n) = (n+1)*(2*n+1)*(4*n+1).at n=17A079588
• Numbers whose number of divisors equals the sum of their separate prime-power decompositions.at n=18A087004
• 75-gonal numbers: a(n) = n*(73*n-71)/2.at n=35A098230
• Structured icosidodecahedral numbers.at n=17A100147
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=9.at n=37A135194
• Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=3A162850
• Numbers with prime factorization pqrst^3.at n=33A189984
• Augmentation of the Euler partition triangle A026820. See Comments.at n=41A193591
• Left part of the square of the n-th Kaprekar number.at n=28A194218
• Smallest k such that (k+p(1)) (k+p(2))...(k+p(n))/(p(n)#) is an integer.at n=18A215489
• Even octagonal pyramidal numbers (A002414).at n=16A218327
• G.f.: A(x,y) = Sum_{n>=0} exp(-y/(1-n*x)) * y^n/(1-n*x)^n / n!.at n=39A245111
• a(n) = Sum_{k=0..n/2} binomial(n+3,k)*binomial(n+1-k,k+1).at n=10A262720
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 331", based on the 5-celled von Neumann neighborhood.at n=40A271279
• Smallest k such that the k-th tetrahedral number is divisible by exactly n tetrahedral numbers.at n=35A342808
• a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} sigma( n/gcd(x_1, x_2, x_3, n) ).at n=11A373130