Sequences
392,541 sequences
- Combined Diophantine Chebyshev sequences A077409 and A077250.A077411
Combined Diophantine Chebyshev sequences A077409 and A077250.
- Chebyshev U(n,x) polynomial evaluated at x=8.A077412
Chebyshev U(n,x) polynomial evaluated at x=8.
- Bisection (odd part) of Chebyshev sequence with Diophantine property.A077413
Bisection (odd part) of Chebyshev sequence with Diophantine property.
- a(n) = n*(n - 1)*(n + 2)/2.A077414
a(n) = n*(n - 1)*(n + 2)/2.
- a(n) = n*(n+2)*(n-2)/3.A077415
a(n) = n*(n+2)*(n-2)/3.
- Chebyshev S-sequence with Diophantine property.A077416
Chebyshev S-sequence with Diophantine property.
- Chebyshev T-sequence with Diophantine property.A077417
Chebyshev T-sequence with Diophantine property.
- Number of divisors of Fibonacci(n+2)-1.A077418
Number of divisors of Fibonacci(n+2)-1.
- Largest Whitney number of Fibonacci lattices J(Z_n).A077419
Largest Whitney number of Fibonacci lattices J(Z_n).
- Bisection of Chebyshev sequence T(n,3) (odd part) with Diophantine property.A077420
Bisection of Chebyshev sequence T(n,3) (odd part) with Diophantine property.
- Chebyshev sequence U(n,11)=S(n,22) with Diophantine property.A077421
Chebyshev sequence U(n,11)=S(n,22) with Diophantine property.
- Chebyshev sequence T(n,11) with Diophantine property.A077422
Chebyshev sequence T(n,11) with Diophantine property.
- Chebyshev sequence U(n,12)=S(n,24) with Diophantine property.A077423
Chebyshev sequence U(n,12)=S(n,24) with Diophantine property.
- Chebyshev sequence T(n,12) with Diophantine property.A077424
Chebyshev sequence T(n,12) with Diophantine property.
- a(n) == 1 (mod 4) (see A016813), but not a square (i.e., not in A000290).A077425
a(n) == 1 (mod 4) (see A016813), but not a square (i.e., not in A000290).
- Nonsquare integers k such that the continued fraction (sqrt(k)+1)/2 has odd period length.A077426
Nonsquare integers k such that the continued fraction (sqrt(k)+1)/2 has odd period length.
- Primitive period length of (regular) continued fraction of (sqrt(D(n))+1)/2 for D(n)=A077425(n).A077427
Primitive period length of (regular) continued fraction of (sqrt(D(n))+1)/2 for D(n)=A077425(n).
- Minimal (positive) solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 with D(n)= A077425(n). The companion sequence is b(n)=A078355(n).A077428
Minimal (positive) solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 with D(n)= A077425(n). The companion sequence is b(n)=A078355(n).
- a(n) = floor(log_10(n^2)).A077429
a(n) = floor(log_10(n^2)).
- a(n) = floor(log_10(2*n^2)) + 1.A077430
a(n) = floor(log_10(2*n^2)) + 1.
- n repeated in decimal representation, but separated by enough zeros that the square has the pattern (n^2)(2n^2)(n^2).A077431
n repeated in decimal representation, but separated by enough zeros that the square has the pattern (n^2)(2n^2)(n^2).
- Squares of the form u'v'w, where in decimal representation u=n^2, v=2*n^2 and w=n^2 possibly with a leading zero.A077432
Squares of the form u'v'w, where in decimal representation u=n^2, v=2*n^2 and w=n^2 possibly with a leading zero.
- Number of separating zeros to represent A077431.A077433
Number of separating zeros to represent A077431.
- Duplicate of A076136.A077434
Duplicate of A076136.
- Number of right triangles whose vertices are lattice points in {1,2,...,n} X {1,2,...,n}.A077435
Number of right triangles whose vertices are lattice points in {1,2,...,n} X {1,2,...,n}.
- Let B(n) be the sum of binary digits of n. This sequence contains n such that B(n) = B(n^2).A077436
Let B(n) be the sum of binary digits of n. This sequence contains n such that B(n) = B(n^2).
- Squares whose decimal digits are nonsquares (2, 3, 5, 6, 7, 8).A077437
Squares whose decimal digits are nonsquares (2, 3, 5, 6, 7, 8).
- Numbers k such that Sum_{d|k} mu(d) mu(n/d)^2 = -1.A077438
Numbers k such that Sum_{d|k} mu(d) mu(n/d)^2 = -1.
- Numbers k such that k and k^2 have square decimal digits.A077439
Numbers k such that k and k^2 have square decimal digits.
- Squares and their roots having square decimal digits.A077440
Squares and their roots having square decimal digits.
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.A077441
In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.
- 2*a(n)^2 + 7 is a square.A077442
2*a(n)^2 + 7 is a square.
- Numbers k such that (k^2 - 7)/2 is a square.A077443
Numbers k such that (k^2 - 7)/2 is a square.
- Numbers k such that (k^2 + 4)/2 is a square.A077444
Numbers k such that (k^2 + 4)/2 is a square.
- Numbers k such that (k^2 - 8)/2 is a square.A077445
Numbers k such that (k^2 - 8)/2 is a square.
- Numbers k such that 2*k^2 + 14 is a square.A077446
Numbers k such that 2*k^2 + 14 is a square.
- Numbers k such that (k^2 - 14)/2 is a square.A077447
Numbers k such that (k^2 - 14)/2 is a square.
- Numbers k such that Sum_{d|k} mu(d)*mu(k/d)^2 = +1.A077448
Numbers k such that Sum_{d|k} mu(d)*mu(k/d)^2 = +1.
- Numbers k such that Sum_{d|k} mu(phi(d)) = 0.A077449
Numbers k such that Sum_{d|k} mu(phi(d)) = 0.
- Continued fraction expansion of (29+sqrt(145))/12.A077450
Continued fraction expansion of (29+sqrt(145))/12.
- Decimal expansion of (29+sqrt(145))/12.A077451
Decimal expansion of (29+sqrt(145))/12.
- Continued fraction expansion of 1+sqrt(11)*(sqrt(29)+sqrt(5))/24.A077452
Continued fraction expansion of 1+sqrt(11)*(sqrt(29)+sqrt(5))/24.
- Decimal expansion of 1+sqrt(11)*(sqrt(29)+sqrt(5))/24.A077453
Decimal expansion of 1+sqrt(11)*(sqrt(29)+sqrt(5))/24.
- a(n) = sigma_3(n^3)/sigma(n^3).A077454
a(n) = sigma_3(n^3)/sigma(n^3).
- a(n) = sigma_4(n^4)/sigma(n^4).A077455
a(n) = sigma_4(n^4)/sigma(n^4).
- a(n) = sigma_5(n^5)/sigma(n^5).A077456
a(n) = sigma_5(n^5)/sigma(n^5).
- a(n) = sigma_4(n^4)/sigma_2(n^4).A077457
a(n) = sigma_4(n^4)/sigma_2(n^4).
- a(n) = (a(n-1)*a(n-2) + a(n-2)*a(n-3) + 1)/a(n-4).A077458
a(n) = (a(n-1)*a(n-2) + a(n-2)*a(n-3) + 1)/a(n-4).
- Numbers k such that k and 3*k have the same digital binary sum.A077459
Numbers k such that k and 3*k have the same digital binary sum.
- Number of nonisomorphic ways a loop can cross a road (running East-West) 2n times.A077460
Number of nonisomorphic ways a loop can cross a road (running East-West) 2n times.