32865

Appears in sequences

• a(n) = n^3 + 3*n + 1.at n=32A005491
• a(n) = [ C(2n,n)/2^(n+2) ].at n=20A024505
• Quotients k*(k+1)*(k+2) / (k+(k+1)+(k+2)) that are lucky numbers.at n=23A032792
• Odd numbers with exactly 4 distinct palindromic prime factors.at n=13A046406
• Number of closed walks of length n along the edges of an icosahedron based at a vertex.at n=8A054884
• Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.at n=31A071595
• Triangle, read by rows, equal to R^2, the matrix square of R = A135894.at n=31A135895
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1,-1), (-1,0), (-1,1), (0,-1), (0,1), (1,-1), (1,0), (1,1)}.at n=7A151496
• a(n) = 14*n^3 - 30*n^2 + 24*n - 7.at n=13A155883
• p*(p+2)/3 where p and p+4 are primes.at n=18A181093
• Number of n X 4 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally.at n=10A183346
• Ceiling((n+1/n)^3).at n=31A197773
• Number of partitions of n^2 into at most three parts.at n=25A274250
• Numbers k such that (25*10^k + 167) / 3 is prime.at n=25A276470
• Expansion of e.g.f. 1/(1 - x)^exp(-x).at n=9A298374
• a(n) = Sum_{d|n} phi(n/d) * (2^d - 1).at n=14A346558
• Locations of records in A365196.at n=10A365239
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) = (n-k)*T(n-1,k-1) + 2*(k+1)*T(n-1,k) + A102365(n,k) with T(n,k) = 0 if k < 0 or k > n.at n=32A382629