Sequences
392,541 sequences
- a(1) = 8, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).A080811
a(1) = 8, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).
- a(1) = 9, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).A080812
a(1) = 9, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).
- Lexicographically largest overlap-free binary sequence.A080813
Lexicographically largest overlap-free binary sequence.
- Successive words in the formal D0L language that produces the Thue-Morse sequence A001285 (start with 1, map 1 -> 12, 2 -> 21).A080814
Successive words in the formal D0L language that produces the Thue-Morse sequence A001285 (start with 1, map 1 -> 12, 2 -> 21).
- Successive strings in the construction of the Thue-Morse sequence A001285.A080815
Successive strings in the construction of the Thue-Morse sequence A001285.
- Triangle read by rows in which n-th row gives trajectory of n (omitting n itself) under the map k -> k+1 if k odd, k -> k/2 if k even.A080816
Triangle read by rows in which n-th row gives trajectory of n (omitting n itself) under the map k -> k+1 if k odd, k -> k/2 if k even.
- Leading diagonal of triangle in A080818.A080817
Leading diagonal of triangle in A080818.
- Triangle read by rows in which the n-th row contains n distinct numbers whose sum is the smallest square.A080818
Triangle read by rows in which the n-th row contains n distinct numbers whose sum is the smallest square.
- Row sums from triangle in A080818.A080819
Row sums from triangle in A080818.
- Least m such that m^2 >= n*(n+1)/2.A080820
Least m such that m^2 >= n*(n+1)/2.
- Primes in the accumulated tally of steps in the x+1 problem: Repeat until 1 is reached: if x is even divide by 2, otherwise add 1.A080821
Primes in the accumulated tally of steps in the x+1 problem: Repeat until 1 is reached: if x is even divide by 2, otherwise add 1.
- Primes in A058633.A080822
Primes in A058633.
- a(n)=n for n<=4; for n>4, a(n) is the smallest integer greater than a(n-1) that shares common factors with some (i.e., at least one) but not all of previous 4 terms.A080823
a(n)=n for n<=4; for n>4, a(n) is the smallest integer greater than a(n-1) that shares common factors with some (i.e., at least one) but not all of previous 4 terms.
- Numbers k such that T(k) = T(A072522(k)) + T(A072522(k+1)), T(i) being the triangular numbers.A080824
Numbers k such that T(k) = T(A072522(k)) + T(A072522(k+1)), T(i) being the triangular numbers.
- Triangle read by rows in which n-th row gives trajectory of n (omitting n itself) under the map k -> k-1 if k odd, k -> k/2 if k even.A080825
Triangle read by rows in which n-th row gives trajectory of n (omitting n itself) under the map k -> k-1 if k odd, k -> k/2 if k even.
- Successive factors of the Thue-Morse word defined by sequence A001285.A080826
Successive factors of the Thue-Morse word defined by sequence A001285.
- Rounded up staircase on natural numbers.A080827
Rounded up staircase on natural numbers.
- Triangle read by rows in which n-th row gives trajectory of n (omitting n itself) under the map k -> 3k-1 if k odd, k -> k/2 if k even, stopping when reach 1, 5 or 17.A080828
Triangle read by rows in which n-th row gives trajectory of n (omitting n itself) under the map k -> 3k-1 if k odd, k -> k/2 if k even, stopping when reach 1, 5 or 17.
- Primes that terminate at 20,10,5 in the 3x-1 problem: Repeat, if x is even divide by 2 else multiply by 3 and subtract 1, until 5 is reached.A080829
Primes that terminate at 20,10,5 in the 3x-1 problem: Repeat, if x is even divide by 2 else multiply by 3 and subtract 1, until 5 is reached.
- Primes that terminate at 68,34,17 in the 3x-1 problem: Repeat, if x is even divide by 2 else multiply by 3 and subtract 1, until 17 is reached.A080830
Primes that terminate at 68,34,17 in the 3x-1 problem: Repeat, if x is even divide by 2 else multiply by 3 and subtract 1, until 17 is reached.
- Expansion of e.g.f. exp(tan(exp(x)-1)).A080831
Expansion of e.g.f. exp(tan(exp(x)-1)).
- Expansion of e.g.f. exp(x) * (sec(exp(x) - 1))^2.A080832
Expansion of e.g.f. exp(x) * (sec(exp(x) - 1))^2.
- E.g.f.: exp( x/(1 - x - x^2) ).A080833
E.g.f.: exp( x/(1 - x - x^2) ).
- E.g.f. exp( x/(1 - x - x^2) ) / (1 - x - x^2).A080834
E.g.f. exp( x/(1 - x - x^2) ) / (1 - x - x^2).
- E.g.f.: exp( x/( 1 - x - x^2 - x^3 ) ).A080835
E.g.f.: exp( x/( 1 - x - x^2 - x^3 ) ).
- Expansion of e.g.f. exp(x/( 1 - x - x^2 - x^3 - x^4 )).A080836
Expansion of e.g.f. exp(x/( 1 - x - x^2 - x^3 - x^4 )).
- Jouka numbers: either the number is divisible by 7 or 11 or has a 7 in its decimal representation.A080837
Jouka numbers: either the number is divisible by 7 or 11 or has a 7 in its decimal representation.
- Orchard crossing number of complete bipartite graph K_{1,n}.A080838
Orchard crossing number of complete bipartite graph K_{1,n}.
- Number of positive increasing integer sequences of length n with Gilbreath transform (that is, the diagonal of leading successive absolute differences) given by {1,1,1,1,1,...}.A080839
Number of positive increasing integer sequences of length n with Gilbreath transform (that is, the diagonal of leading successive absolute differences) given by {1,1,1,1,1,...}.
- Number of cousin primes < 10^n.A080840
Number of cousin primes < 10^n.
- Number of pairs (p,q) of (not necessarily consecutive) primes with q-p = 6 and q < 10^n.A080841
Number of pairs (p,q) of (not necessarily consecutive) primes with q-p = 6 and q < 10^n.
- Numbers in the x/3 + 1 conjecture: Repeat until 1 is reached: if x is divisible by 3 then divide by 3, otherwise add 1.A080842
Numbers in the x/3 + 1 conjecture: Repeat until 1 is reached: if x is divisible by 3 then divide by 3, otherwise add 1.
- Tribonacci word: limit S(infinity), where S(0) = 0, S(1) = 0,1, S(2) = 0,1,0,2 and for n >= 0, S(n+3) = S(n+2) S(n+1) S(n).A080843
Tribonacci word: limit S(infinity), where S(0) = 0, S(1) = 0,1, S(2) = 0,1,0,2 and for n >= 0, S(n+3) = S(n+2) S(n+1) S(n).
- G.f. is F^2, where F is g.f. for Fibonacci word (A003849).A080844
G.f. is F^2, where F is g.f. for Fibonacci word (A003849).
- G.f. is 1/F, where x*F is g.f. for Fibonacci word (A003849).A080845
G.f. is 1/F, where x*F is g.f. for Fibonacci word (A003849).
- Fixed point of the morphism 0->010, 1->011, starting from a(1) = 0.A080846
Fixed point of the morphism 0->010, 1->011, starting from a(1) = 0.
- a(n) = mu(n)+2, where mu is the Moebius function (A008683).A080847
a(n) = mu(n)+2, where mu is the Moebius function (A008683).
- a(n) = n*(mu(n)+2), where mu is the Moebius function (A008683).A080848
a(n) = n*(mu(n)+2), where mu is the Moebius function (A008683).
- a(n) = (mu(n)+2)*n^2, where mu is the Moebius function (A008683).A080849
a(n) = (mu(n)+2)*n^2, where mu is the Moebius function (A008683).
- Number triangle related to a problem of Knuth.A080850
Number triangle related to a problem of Knuth.
- Square array of pyramidal numbers, read by antidiagonals.A080851
Square array of pyramidal numbers, read by antidiagonals.
- Square array of 4D pyramidal numbers, read by antidiagonals.A080852
Square array of 4D pyramidal numbers, read by antidiagonals.
- Square array of generalized polygonal numbers, read by antidiagonals.A080853
Square array of generalized polygonal numbers, read by antidiagonals.
- Numbers which can be expressed as the sum of two distinct primes in exactly five ways.A080854
Numbers which can be expressed as the sum of two distinct primes in exactly five ways.
- a(n) = (9*n^2 - 3*n + 2)/2.A080855
a(n) = (9*n^2 - 3*n + 2)/2.
- a(n) = 8*n^2 - 4*n + 1.A080856
a(n) = 8*n^2 - 4*n + 1.
- a(n) = (25*n^2 - 15*n + 2)/2.A080857
a(n) = (25*n^2 - 15*n + 2)/2.
- Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal.A080858
Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal.
- a(n) = 6*n^2 + 4*n + 1.A080859
a(n) = 6*n^2 + 4*n + 1.
- a(n) = 10*n^2 + 5*n + 1.A080860
a(n) = 10*n^2 + 5*n + 1.