36872

Appears in sequences

• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 48.at n=7A031726
• Sums of 3 distinct powers of 8.at n=17A038485
• Number of odious primes (A027697) in range ]2^n,2^(n+1)].at n=19A095005
• Define a(1)=0, a(2)=0, a(3)=3, a(4)=7 such that from i=1 to 4: 30*a(i)^2 + 30*a(i) + 1 = j(i)^2, j(1)=1, j(2)=1, j(3)=19, j(4)=41 Then a(n) = a(n-4) + 4*sqrt(30*(a(n-2)^2) + 30*a(n-2) + 1).at n=8A103737
• a(n) = n*(8*n^2 + 1)/3.at n=24A143166
• a(n) = 64*n^2 + 8.at n=23A158488
• Triangle of coefficients of polynomials v(n,x) jointly generated with A210221; see the Formula section.at n=52A210599
• Number of (n+6)X12 0..1 matrices with each 7X7 subblock idempotent.at n=7A224586
• Numbers k such that if x = sigma(k) + tau(k) - k then k = sigma(x) + tau(x) - x.at n=25A238226
• Number of (n+2) X (1+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=11A258959
• Lesser members of dihedral amicable pairs: numbers (m, k) such that t(m) = t(k) = m + k, where t(k) = sigma(k) + d(k).at n=8A320457
• Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).at n=54A360862