38056

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones.at n=20A031789
• Second term in the continued fraction expansion of StieltjesGamma[n].at n=17A066034
• The sum of a triangular array made from a negative 6-fold permutation product.at n=18A105156
• First differences (A131771) equal this sequence with terms repeated at positions: {m*(m+1)/2, m>=0}.at n=29A131770
• First differences (A131772) equal this sequence with zeros inserted at positions {m*(m+1)/2, m>=0}.at n=36A131771
• Partial sums (A131771) equal this sequence excluding zeros located at positions {m*(m+1)/2, m>=0}, with a(0)=1.at n=44A131772
• a(n) = prime(n) * Sum_{i=1..n} prime(i).at n=18A143215
• Number of (n+1) X 5 0..3 arrays with every 2 X 2 subblock summing to 6.at n=4A183637
• Number of (n+1) X 6 0..3 arrays with every 2 X 2 subblock summing to 6.at n=3A183638
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 6.at n=31A183642
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 6.at n=32A183642
• Triangular array read by rows. T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} that have exactly k 3-cycles. n>=0, 0<=k<=floor(n/3).at n=9A185070
• a(0)=0; thereafter a(n) = A238824(n-1)+A238825(n).at n=14A238828
• Inverse Euler transform of the Euler totient function phi = A000010.at n=31A320778
• Product_{n>=1} (1 + x^n)^a(n) = 1 + Sum_{n>=1} phi(n) * x^n, where phi = A000010.at n=30A328774
• Product_{n>=1} (1 + a(n)*x^n) = 1 + Sum_{n>=1} phi(n)*x^n, where phi = A000010.at n=30A353925
• Product_{n>=1} 1 / (1 - a(n)*x^n) = 1 + Sum_{n>=1} phi(n)*x^n, where phi = A000010.at n=30A353948
• Number of subsets of {1,2,...,n} such that no two elements differ by 3, 4, or 5.at n=27A375984
• a(n) = 1 + Sum_{k=0..n-1} (k+1)^3 * a(k) * a(n-k-1).at n=4A376127