Sequences
392,541 sequences
- Decimal expansion of the number which results when the Boustrophedon transform of the continued fraction of gamma (A080410) is interpreted as a continued fraction.A080411
Decimal expansion of the number which results when the Boustrophedon transform of the continued fraction of gamma (A080410) is interpreted as a continued fraction.
- Exchange rightmost two binary digits of n > 1; a(0)=0, a(1)=2.A080412
Exchange rightmost two binary digits of n > 1; a(0)=0, a(1)=2.
- Take the rightmost three binary digits of n (for n<4 padded with leading zeros) and rotate left 1 digit.A080413
Take the rightmost three binary digits of n (for n<4 padded with leading zeros) and rotate left 1 digit.
- Take the rightmost three binary digits of n (for n<4 padded with leading zeros) and rotate right 1 digit.A080414
Take the rightmost three binary digits of n (for n<4 padded with leading zeros) and rotate right 1 digit.
- a(n) is the number of distinct substrings in the initial string of length n of the repetition-resistant sequence A079101.A080415
a(n) is the number of distinct substrings in the initial string of length n of the repetition-resistant sequence A079101.
- Stirling-like number triangle defined by paired decomposition of C(n+3,3) = A000292.A080416
Stirling-like number triangle defined by paired decomposition of C(n+3,3) = A000292.
- Signed Stirling numbers of the second kind.A080417
Signed Stirling numbers of the second kind.
- Generalized Pascal triangle.A080418
Generalized Pascal triangle.
- Triangle of generalized Chebyshev coefficients.A080419
Triangle of generalized Chebyshev coefficients.
- a(n) = (n+1)*(n+6)*3^n/6.A080420
a(n) = (n+1)*(n+6)*3^n/6.
- a(n) = (n+1)*(n+2)*(n+9)*3^n/18.A080421
a(n) = (n+1)*(n+2)*(n+9)*3^n/18.
- a(n) = (n+1)*(n+2)*(n+3)*(n+12)*3^n/72.A080422
a(n) = (n+1)*(n+2)*(n+3)*(n+12)*3^n/72.
- a(n) = (n+1)*(n+2)*(n+3)*(n+4)*(n+15)*3^n/360.A080423
a(n) = (n+1)*(n+2)*(n+3)*(n+4)*(n+15)*3^n/360.
- a(n) = 3*a(n-1) + 18*a(n-2), a(0)=0, a(1)=1.A080424
a(n) = 3*a(n-1) + 18*a(n-2), a(0)=0, a(1)=1.
- Period 3: repeat [0, 2, 1].A080425
Period 3: repeat [0, 2, 1].
- a(1)=1, a(2)=3; all terms are either 1 or 3; each run of 3's is followed by a run of two 1's; and a(n) is the length of the n-th run of 3's.A080426
a(1)=1, a(2)=3; all terms are either 1 or 3; each run of 3's is followed by a run of two 1's; and a(n) is the length of the n-th run of 3's.
- a(1)=1 and, for n>1, a(n) is the smallest positive integer such that the absolute difference |a(n)-a(n-1)| has not occurred previously.A080427
a(1)=1 and, for n>1, a(n) is the smallest positive integer such that the absolute difference |a(n)-a(n-1)| has not occurred previously.
- First differences of A079255.A080428
First differences of A079255.
- Odd numbers such that all a(i)*a(j) with i<j are distinct.A080429
Odd numbers such that all a(i)*a(j) with i<j are distinct.
- a(n) = least odd number such that all pairwise sums a(i) + a(j), i < j <= n, are distinct.A080430
a(n) = least odd number such that all pairwise sums a(i) + a(j), i < j <= n, are distinct.
- Even numbers such that all a(i)*a(j) are distinct.A080431
Even numbers such that all a(i)*a(j) are distinct.
- Even numbers such that all a(i) + a(j) are distinct.A080432
Even numbers such that all a(i) + a(j) are distinct.
- a(1) = 2; for n>1, a(n) = smallest multiple of n beginning with the least significant digit of a(n-1) > n and not divisible by 10 if n is not of the type 10k; otherwise a(n) ends in 0 and a(n+1) begins with the first nonzero digit from the right(LSD) of a(n).A080433
a(1) = 2; for n>1, a(n) = smallest multiple of n beginning with the least significant digit of a(n-1) > n and not divisible by 10 if n is not of the type 10k; otherwise a(n) ends in 0 and a(n+1) begins with the first nonzero digit from the right(LSD) of a(n).
- Duplicate of A062567.A080434
Duplicate of A062567.
- a(1) = 1; a(n) = least k > a(n-1) such that each prime of form a(i)+a(j) occurs for unique i <= j.A080435
a(1) = 1; a(n) = least k > a(n-1) such that each prime of form a(i)+a(j) occurs for unique i <= j.
- Smallest multiple of n obtained by inserting digits between every pair of digits of n. If n is a k-digit number then there are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.A080436
Smallest multiple of n obtained by inserting digits between every pair of digits of n. If n is a k-digit number then there are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.
- For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.A080437
For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.
- Smallest square obtained by inserting one or more digits between every pair of consecutive digits of n^2.A080438
Smallest square obtained by inserting one or more digits between every pair of consecutive digits of n^2.
- a(1) = 11, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).A080439
a(1) = 11, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).
- a(1) = 13, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).A080440
a(1) = 13, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).
- a(1) = 17, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).A080441
a(1) = 17, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).
- a(1) = 19, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).A080442
a(1) = 19, a(n) is the smallest prime obtained by inserting digits between every pair of digits of a(n-1).
- Largest prime factor of 3^n+2.A080443
Largest prime factor of 3^n+2.
- Write n A001055(n) times.A080444
Write n A001055(n) times.
- a(1) = 1, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).A080445
a(1) = 1, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
- a(1) = 2, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).A080446
a(1) = 2, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
- a(1) = 3, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).A080447
a(1) = 3, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
- a(1) = 4, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.A080448
a(1) = 4, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.
- a(1) = 5, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.A080449
a(1) = 5, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.
- a(1) = 6, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.A080450
a(1) = 6, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1). Also a(n) is not divisible by 10.
- a(1) = 7, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).A080451
a(1) = 7, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
- a(1) = 8, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).A080452
a(1) = 8, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
- a(1) = 9, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).A080453
a(1) = 9, a(n) = smallest (nontrivial) multiple of a(n-1) containing n digits, a(n) not equal to 10*a(n-1).
- Smallest multiple of n beginning with the backward concatenation of numbers from (n-1) to 1.A080454
Smallest multiple of n beginning with the backward concatenation of numbers from (n-1) to 1.
- a(1)=1; for n>1, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.A080455
a(1)=1; for n>1, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.
- a(1) = a(2) = 2; for n > 2, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.A080456
a(1) = a(2) = 2; for n > 2, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.
- a(1)=3; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A080457
a(1)=3; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- a(1)=4; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A080458
a(1)=4; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- Trans-Harshad numerals: base-10 numerals that represent positive Harshad numbers in every base in which they occur.A080459
Trans-Harshad numerals: base-10 numerals that represent positive Harshad numbers in every base in which they occur.
- a(1) = 2; for n > 1, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.A080460
a(1) = 2; for n > 1, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.