Sequences
392,541 sequences
- Integer part of length of diagonal of integral rectangle with area n and smallest semiperimeter.A079311
Integer part of length of diagonal of integral rectangle with area n and smallest semiperimeter.
- a(n) = 4 * A079137(n).A079312
a(n) = 4 * A079137(n).
- a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is odd".A079313
a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is odd".
- Number of first-quadrant cells (including the two boundaries) born at stage n of the Holladay-Ulam cellular automaton.A079314
Number of first-quadrant cells (including the two boundaries) born at stage n of the Holladay-Ulam cellular automaton.
- Number of cells that change from OFF to ON at stage n of the cellular automaton described in A079317.A079315
Number of cells that change from OFF to ON at stage n of the cellular automaton described in A079317.
- Number of first-quadrant cells (including the two boundaries) that are ON at stage n of the cellular automaton described in A079317.A079316
Number of first-quadrant cells (including the two boundaries) that are ON at stage n of the cellular automaton described in A079317.
- Number of ON cells after n generations of cellular automaton on square grid in which cells which share exactly one edge with an ON cell change their state.A079317
Number of ON cells after n generations of cellular automaton on square grid in which cells which share exactly one edge with an ON cell change their state.
- a(0) = 1; for n > 0, a(n) = (3^(A000120(n)-1) + 1)/2.A079318
a(0) = 1; for n > 0, a(n) = (3^(A000120(n)-1) + 1)/2.
- a(0) = 1; for n >= 1, a(n) = 4*a(n-1) - (2^n - 1).A079319
a(0) = 1; for n >= 1, a(n) = 4*a(n-1) - (2^n - 1).
- CATS sequence: cube-add-then-sort variation of RATS (reverse, add then sort) sequence.A079320
CATS sequence: cube-add-then-sort variation of RATS (reverse, add then sort) sequence.
- Composite numbers of the form 1^1 * 2^2 * 3^3 * 4^4 * ... * n^n + 1.A079321
Composite numbers of the form 1^1 * 2^2 * 3^3 * 4^4 * ... * n^n + 1.
- Composite numbers of the form 1^1 * 2^2 * 3^3 * 4^4 * ... * n^n + 11.A079322
Composite numbers of the form 1^1 * 2^2 * 3^3 * 4^4 * ... * n^n + 11.
- First number in a sequence of 4 consecutive economical numbers.A079323
First number in a sequence of 4 consecutive economical numbers.
- k such that 2kp+1 is the first factor of a nonprime Mersenne number M(p) = 2^p - 1.A079324
k such that 2kp+1 is the first factor of a nonprime Mersenne number M(p) = 2^p - 1.
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a member of A079000".A079325
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a member of A079000".
- a(n) = the largest number m such that if m monominoes are removed from an n X n square then an L-tromino must remain.A079326
a(n) = the largest number m such that if m monominoes are removed from an n X n square then an L-tromino must remain.
- Smallest nonnegative integer x such that b^(n-1) == b^x (mod n) for all b that are 0 < b < n.A079327
Smallest nonnegative integer x such that b^(n-1) == b^x (mod n) for all b that are 0 < b < n.
- Let f(n)=A001359(n) be the smaller member of the n-th pair of twin primes. Then a(n) is the average of f(n) and f(n+1).A079328
Let f(n)=A001359(n) be the smaller member of the n-th pair of twin primes. Then a(n) is the average of f(n) and f(n+1).
- Let g(n)=A006512(n) be the larger member of the n-th pair of twin primes. Then a(n) is the average of g(n) and g(n+1).A079329
Let g(n)=A006512(n) be the larger member of the n-th pair of twin primes. Then a(n) is the average of g(n) and g(n+1).
- Numerators of coefficients of odd powers of 1/q in the solution series for tan(x)/x=1.A079330
Numerators of coefficients of odd powers of 1/q in the solution series for tan(x)/x=1.
- Values of k at which successive minima of tan(k)/k occur.A079331
Values of k at which successive minima of tan(k)/k occur.
- Values of n at which successive maxima of tan(n)/n occur.A079332
Values of n at which successive maxima of tan(n)/n occur.
- Duplicate of A063938.A079333
Duplicate of A063938.
- Numbers k such that k divides tau(k) and k+1 divides tau(k+1), where tau(k)=A000594(k) is Ramanujan's tau function; i.e., k and k+1 are in A063938.A079334
Numbers k such that k divides tau(k) and k+1 divides tau(k+1), where tau(k)=A000594(k) is Ramanujan's tau function; i.e., k and k+1 are in A063938.
- Positions of 1 in the repetition-resistant sequence A079101.A079335
Positions of 1 in the repetition-resistant sequence A079101.
- A repetition-resistant sequence.A079336
A repetition-resistant sequence.
- Positions of 0 in the repetition-resistant sequence A079336.A079337
Positions of 0 in the repetition-resistant sequence A079336.
- Positions of 1 in the repetition-resistant sequence A079336.A079338
Positions of 1 in the repetition-resistant sequence A079336.
- Least k such that the decimal representation of k*n contains only 1's and 0's.A079339
Least k such that the decimal representation of k*n contains only 1's and 0's.
- Absolute value of determinant of n X n matrix whose entries are the integers from 1 to n^2 spiraling outward, ending in a corner.A079340
Absolute value of determinant of n X n matrix whose entries are the integers from 1 to n^2 spiraling outward, ending in a corner.
- Triangular array read by rows: GCDs of entries in A010940.A079341
Triangular array read by rows: GCDs of entries in A010940.
- Integers k that divide LS(k), where LS is the "Look and Say" function (A045918).A079342
Integers k that divide LS(k), where LS is the "Look and Say" function (A045918).
- Period 6: repeat [0, 1, 1, 2, 3, 1]; also F(n) mod 4, where F(n) = A000045(n).A079343
Period 6: repeat [0, 1, 1, 2, 3, 1]; also F(n) mod 4, where F(n) = A000045(n).
- F(n) mod 8, where F(n) = A000045(n) is the n-th Fibonacci number.A079344
F(n) mod 8, where F(n) = A000045(n) is the n-th Fibonacci number.
- Fibonacci(n) mod 16.A079345
Fibonacci(n) mod 16.
- Primes p such that F(p-(p/5)) is the first Fibonacci number that p divides.A079346
Primes p such that F(p-(p/5)) is the first Fibonacci number that p divides.
- Fibonacci(p-(p/5)) is the first Fibonacci number that p divides and this is p-(p/5).A079347
Fibonacci(p-(p/5)) is the first Fibonacci number that p divides and this is p-(p/5).
- Fibonacci(p-(p/5)) is the not the first Fibonacci number that p divides.A079348
Fibonacci(p-(p/5)) is the not the first Fibonacci number that p divides.
- p-(p/5) where Fibonacci(p-(p/5)) is not the first Fibonacci number that p divides.A079349
p-(p/5) where Fibonacci(p-(p/5)) is not the first Fibonacci number that p divides.
- "Look and Say" (or LS) transform of A079342(n). These terms are such that A079342(n) divides a(n).A079350
"Look and Say" (or LS) transform of A079342(n). These terms are such that A079342(n) divides a(n).
- a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 5)".A079351
a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 0 (mod 5)".
- a(1)=1, then a(n)=3*a(n-1) if n is already in the sequence, a(n)=2*a(n-1) otherwise.A079352
a(1)=1, then a(n)=3*a(n-1) if n is already in the sequence, a(n)=2*a(n-1) otherwise.
- Numbers n such that the best rational approximation to H(n) with denominator <=n is an integer, where H(n) denotes the n-th harmonic number (A001008/A002805).A079353
Numbers n such that the best rational approximation to H(n) with denominator <=n is an integer, where H(n) denotes the n-th harmonic number (A001008/A002805).
- a(1)=1; a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.A079354
a(1)=1; a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.
- a(1) = 1; a(n) = a(n-1)-3 if n is already in the sequence, a(n) = a(n-1)+4 otherwise.A079355
a(1) = 1; a(n) = a(n-1)-3 if n is already in the sequence, a(n) = a(n-1)+4 otherwise.
- a(1)=1; a(n) = a(n-1) - 2 if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.A079356
a(1)=1; a(n) = a(n-1) - 2 if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.
- a(1)=1; a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A079357
a(1)=1; a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not a multiple of either 3 or 4.".A079358
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not a multiple of either 3 or 4.".
- Iterate the process: "sum of terms of n-th run" on the Kolakoski sequence until all runs have length 1.A079359
Iterate the process: "sum of terms of n-th run" on the Kolakoski sequence until all runs have length 1.
- Sequence of sums of alternating increasing powers of 2.A079360
Sequence of sums of alternating increasing powers of 2.