Sequences

392,541 sequences

a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n.A026461
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.A026462
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.A026463
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n.A026464
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n.
Length of n-th run of identical symbols in the Thue-Morse sequence A010060 (or A001285).A026465
Length of n-th run of identical symbols in the Thue-Morse sequence A010060 (or A001285).
a(1) = 1; for n > 1, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<j<=n-1.A026466
a(1) = 1; for n > 1, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<j<=n-1.
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<j<=n.A026467
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<j<=n.
a(1) = 1, a(2) = 2; for n >= 3, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<=j<=n-1.A026468
a(1) = 1, a(2) = 2; for n >= 3, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<=j<=n-1.
a(1) = 1; for n > 1, a(n) = least positive integer > a(n-1) and not equal to a(i)^2 + a(j)^2 for 1<=i<=j<=n-1.A026469
a(1) = 1; for n > 1, a(n) = least positive integer > a(n-1) and not equal to a(i)^2 + a(j)^2 for 1<=i<=j<=n-1.
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<=j<=n.A026470
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 for 1<=i<=j<=n.
a(n) = least positive integer > a(n-1) and not of the form a(i) + a(j) + a(k) for 1 <= i < j < k <= n.A026471
a(n) = least positive integer > a(n-1) and not of the form a(i) + a(j) + a(k) for 1 <= i < j < k <= n.
{3, 7} together with the numbers congruent to {1, 2} mod 12.A026472
{3, 7} together with the numbers congruent to {1, 2} mod 12.
a(n) = least positive integer > a(n-1) and not a(i)+a(j)+a(k) for 1<=i<j<k<=n.A026473
a(n) = least positive integer > a(n-1) and not a(i)+a(j)+a(k) for 1<=i<j<k<=n.
a(n) = least positive integer > a(n-1) and not equal to a(i)+a(j) or a(i)+a(j)+a(k) for 1<=i<j<k<n (a 3-Stohr sequence).A026474
a(n) = least positive integer > a(n-1) and not equal to a(i)+a(j) or a(i)+a(j)+a(k) for 1<=i<j<k<n (a 3-Stohr sequence).
a(1)=1, a(2)=3, otherwise a(n) = least positive integer > a(n-1) and not a(i) + a(j) + a(k) for 1 <= i < j < k <= n.A026475
a(1)=1, a(2)=3, otherwise a(n) = least positive integer > a(n-1) and not a(i) + a(j) + a(k) for 1 <= i < j < k <= n.
For n>3, a(n) = 7*n - 21 + 2*(-1)^n.A026476
For n>3, a(n) = 7*n - 21 + 2*(-1)^n.
a(1) = 1, a(2) = 2, a(3) = 3; and for n > 3, a(n) = smallest number > a(n-1) and not of the form a(i)*a(j)*a(k) for 1 <= i < j < k < n.A026477
a(1) = 1, a(2) = 2, a(3) = 3; and for n > 3, a(n) = smallest number > a(n-1) and not of the form a(i)*a(j)*a(k) for 1 <= i < j < k < n.
a(n) = least positive integer > a(n-1) and not of form a(i)*a(j)*a(k) for 1<=i<=j<=k<n.A026478
a(n) = least positive integer > a(n-1) and not of form a(i)*a(j)*a(k) for 1<=i<=j<=k<n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)*a(k) for 1<=i<j<k<n.A026479
a(n) = least positive integer > a(n-1) and not a(i)*a(j)*a(k) for 1<=i<j<k<n.
a(1) = 1, a(2) = 2, a(3) = 4, and for n > 3, a(n) is the least positive integer > a(n-1) not of form a(i)*a(j)*a(k) for 1 <= i <= j <= k < n.A026480
a(1) = 1, a(2) = 2, a(3) = 4, and for n > 3, a(n) is the least positive integer > a(n-1) not of form a(i)*a(j)*a(k) for 1 <= i <= j <= k < n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)*a(k) for 1<=i<j<k<n.A026481
a(n) = least positive integer > a(n-1) and not a(i)*a(j)*a(k) for 1<=i<j<k<n.
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)*a(k) for 1<=i<=j<=k<n.A026482
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)*a(k) for 1<=i<=j<=k<n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<j<k<=n.A026483
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<j<k<=n.
Erroneous version of A026488.A026484
Erroneous version of A026488.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<j<k<n.A026485
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<j<k<n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<=j<=k<n.A026486
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<=j<=k<n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<j<k<n.A026487
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1<=i<j<k<n.
a(n) is the least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1 <= i <= j <= k <= n, where a(1) = 1.A026488
a(n) is the least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1 <= i <= j <= k <= n, where a(1) = 1.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+a(k) for 1<=i<j<k<=n.A026489
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+a(k) for 1<=i<j<k<=n.
Length of n-th run of identical symbols in A026465.A026490
Length of n-th run of identical symbols in A026465.
a(n) = least k > a(n-1) such that A001285(k-1) = A001285(n-1) for n >= 1.A026491
a(n) = least k > a(n-1) such that A001285(k-1) = A001285(n-1) for n >= 1.
a(n) = t(3n), where t = A001285 (Thue-Morse sequence).A026492
a(n) = t(3n), where t = A001285 (Thue-Morse sequence).
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+a(k) for 1<=i<j<k<=n.A026493
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+a(k) for 1<=i<j<k<=n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+a(k) for 1<=i<=j<=k<=n.A026494
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+a(k) for 1<=i<=j<=k<=n.
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<j<k<=n.A026495
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<j<k<=n.
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<=j<=k<=n.A026496
a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<=j<=k<=n.
a(n) = length of n-th run of identical symbols in A026492.A026497
a(n) = length of n-th run of identical symbols in A026492.
a(n) = t(1+3n), where t = A001285 (Thue-Morse sequence).A026498
a(n) = t(1+3n), where t = A001285 (Thue-Morse sequence).
a(n) = length of n-th run of identical symbols in A026498.A026499
a(n) = length of n-th run of identical symbols in A026498.
For n >= 3, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<=j<=k<=n.A026500
For n >= 3, a(n) = least positive integer > a(n-1) and not a(i)^2 + a(j)^2 + a(k)^2 for 1<=i<=j<=k<=n.
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<j<k<n.A026501
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<j<k<n.
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<=j<=k<=n.A026502
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<=j<=k<=n.
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<j<k<=n.A026503
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<j<k<=n.
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<=j<=k<=n.A026504
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<=j<=k<=n.
a(n) is the least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1 <= i < j < k <= n.A026505
a(n) is the least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1 <= i < j < k <= n.
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<=j<=k<=n.A026506
a(n) = least positive integer > a(n-1) and not a(j)*a(k) + a(k)*a(i) + a(i)*a(j) for 1<=i<=j<=k<=n.
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<j<k<=n.A026507
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<j<k<=n.
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<=j<=k<=n.A026508
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<=j<=k<=n.
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<j<k<=n.A026509
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<j<k<=n.
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<=j<=k<=n.A026510
a(n) = least positive integer > a(n-1) and not (a(i)+a(j))^2 - a(k)^2 for 1<=i<=j<=k<=n.