Sequences

392,541 sequences

Position of the second n in A026409.A026411
Position of the second n in A026409.
a(n) = position of the n-th n in A026409.A026412
a(n) = position of the n-th n in A026409.
a(n) = greatest number of numbers between consecutive appearances of n in A026409.A026413
a(n) = greatest number of numbers between consecutive appearances of n in A026409.
a(n) = greatest integer not found after first n in A026409.A026414
a(n) = greatest integer not found after first n in A026409.
Numbers k such that A026409(k) is odd.A026415
Numbers k such that A026409(k) is odd.
A 2-way classification of integers: a(1) = 1, a(2) = 2 and for n > 2, a(n) is the smallest number not of the form a(i)*a(j) for 1 <= i < j < n.A026416
A 2-way classification of integers: a(1) = 1, a(2) = 2 and for n > 2, a(n) is the smallest number not of the form a(i)*a(j) for 1 <= i < j < n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 1,3.A026417
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 1,3.
Number of ordered trees with n edges and having no branches of length 1.A026418
Number of ordered trees with n edges and having no branches of length 1.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 1,4.A026419
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 1,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 2,4.A026420
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 2,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 3,4.A026421
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<j<=n, with initial terms 3,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1 <= i <= j < n.A026422
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1 <= i <= j < n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<=j<=n, n >= 2.A026423
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<=j<=n, n >= 2.
Number of prime divisors (counted with multiplicity) is odd; Liouville function lambda(n) (A008836) is negative.A026424
Number of prime divisors (counted with multiplicity) is odd; Liouville function lambda(n) (A008836) is negative.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<=j<=n, n >= 2.A026425
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<=j<=n, n >= 2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<=j<=n, n >= 2.A026426
a(n) = least positive integer > a(n-1) and not a(i)*a(j) for 1<=i<=j<=n, n >= 2.
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j) for 1<=i<=j<=n.A026427
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j) for 1<=i<=j<=n.
a(n) = position of n-th prime in A026416.A026428
a(n) = position of n-th prime in A026416.
Position of n-th odd prime in A026417.A026429
Position of n-th odd prime in A026417.
a(n) is the sum of first n terms of A001285 (Thue-Morse sequence).A026430
a(n) is the sum of first n terms of A001285 (Thue-Morse sequence).
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 1,2.A026431
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 1,2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 1,3.A026432
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 1,3.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 2,3.A026433
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 2,3.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 1,4.A026434
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 1,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 2,4.A026435
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 2,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 3,4.A026436
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n, with initial terms 3,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 1,2.A026437
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 1,2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 1,3.A026438
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 1,3.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 2,3.A026439
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 2,3.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 1,4.A026440
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 1,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 2,4.A026441
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 2,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 3,4.A026442
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1 <= i <= j < n, n >= 2, with initial terms 3,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 1,2.A026443
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 1,2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 1,3.A026444
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 1,3.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 2,3.A026445
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 2,3.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 2,4.A026446
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 2,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 3,4.A026447
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for 1<=i<j<=n, with initial terms 3,4.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n.A026448
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n, n >= 2/.A026449
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n, n >= 2/.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n.A026450
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n, n >= 2.A026451
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n, n >= 2.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n.A026452
a(n) = least positive integer > a(n-1) and not a(i)*a(j)+2 for i<=1<=j<=n.
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)-2 for 1<=i<j<=n-1.A026453
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)-2 for 1<=i<j<=n-1.
a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)-2 for 1<=i<j<=n.A026454
a(n) = least positive integer > a(n-1) and not equal to 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.A026455
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.A026456
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.A026457
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.A026458
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<j<=n.
Erroneous version of A026461.A026459
Erroneous version of A026461.
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.A026460
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.