Mathematics Stack Exchange
Mathematics Stack Exchange

Questions tagged [oeis]

For questions related to the On-Line Encyclopedia of Integer Sequences.

The On-Line Encyclopedia of Integer Sequences, also called OEIS, is an online database of integer sequences, founded in 1964 by N.J.A. Sloane, and maintained by the OEIS Foundation.

It currently (February 2018) contains over 298,000 integer sequences.

173 questions
107
votes
0 answers

Mondrian Art Problem Upper Bound for defect

Divide a square of side $n$ into any number of non-congruent rectangles. If all the sides are integers, what is the smallest possible difference in area between the largest and smallest rectangles? This is known as the Mondrian Art Problem. For…
Ed Pegg
  • 19,476
  • 5
  • 37
  • 119
61
votes
1 answer

Is OEIS A248049 an integer sequence?

The OEIS sequence A248049 is defined by $$ a_n \!=\! \frac{(a_{n-1}\!+\!a_{n-2})(a_{n-2}\!+\!a_{n-3})}{a_{n-4}} \;\text{with }\; a_0\!=\!2, a_1\!=\!a_2\!=\!a_3\!=\!1.$$ is apparently an integer sequence but I have no proofs. I have numerical…
Somos
  • 29,394
  • 2
  • 28
  • 63
38
votes
3 answers

Repeatedly taking mean values of non-empty subsets of a set: $2,\,3,\,5,\,15,\,875,\,...$

Consider the following iterative process. We start with a 2-element set $S_0=\{0,1\}$. At $n^{\text{th}}$ step $(n\ge1)$ we take all non-empty subsets of $S_{n-1}$, then for each subset compute the arithmetic mean of its elements, and collect the…
Vladimir Reshetnikov
  • 45,303
  • 7
  • 151
  • 282
34
votes
4 answers

A sequence of coefficients of $x+(x+(x+(x+(x+(x+\dots)^6)^5)^4)^3)^2$

Let's consider a function (or a way to obtain a formal power series): $$f(x)=x+(x+(x+(x+(x+(x+\dots)^6)^5)^4)^3)^2$$ Where $\dots$ is replaced by an infinite sequence of nested brackets raised to $n$th power. The function is defined as the limit…
Yuriy S
  • 30,220
  • 5
  • 48
  • 168
25
votes
0 answers

How many "prime" rectangle tilings are there?

Given two tilings of a rectangle by other rectangles, say that they are equivalent if there is a bijection from the edges, vertices, and faces of the tilings which preserves inclusion. For instance, the following two tilings are equivalent (some…
RavenclawPrefect
  • 11,664
  • 2
  • 19
  • 79
23
votes
5 answers

Greatest number of non-attacking moves that queens can make on an $n \times n$ chess board.

I'm trying to extend my OEIS sequence A275815: Maximum total number of possible moves that any number of queens of the same color can make on an $n \times n$ chessboard. I have computed the first five terms by brute force, and examples of each are…
Peter Kagey
  • 4,789
  • 9
  • 32
  • 80
19
votes
1 answer

Is Conway's "Look and Say Sequence" strictly increasing?

I have a straightforward question about Conway's "Look and Say Sequence (A005150): The integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. Starting with 1, the sequence would be defined…
Brendan W. Sullivan
  • 548
  • 3
  • 18
18
votes
0 answers

Smallest region that can contain all free $n$-ominoes.

A nine-cell region is the smallest subset of the plane that can contain all twelve free pentominoes, as illustrated below. (A free polyomino is one that can be rotated and flipped.) A twelve-cell region is the smallest subset of the plane the can…
Peter Kagey
  • 4,789
  • 9
  • 32
  • 80
17
votes
2 answers

The equation $\sigma(n)=\sigma(n+1)$

In OEIS, the solutions of $$\sigma(n)=\sigma(n+1)$$ where $\sigma(n)$ denotes the sum of the divisors of $n$ including $1$ and $n$ , are shown upto $n=10^{13}$ The entry can be found already by entering the first three solutions $14,206,957$ It is…
Peter
  • 78,494
  • 15
  • 63
  • 194
17
votes
1 answer

A generalization of the product of harmonic numbers to non-integer arguments

This question is somewhat related to one of my previous questions: Fibonorial of a fractional or complex argument. Recall the definition of harmonic numbers: $$H_n=\sum_{k=1}^n\frac1k=1+\frac12+\,...\,+\frac1n\tag1$$ Obviously, harmonic numbers…
Vladimir Reshetnikov
  • 45,303
  • 7
  • 151
  • 282
16
votes
1 answer

How many combinatorially distinct ways are there to tile an equilateral triangle with $k$ $60^\circ-120^\circ$ trapezoids?

I believe there is exactly one way (up to combinatorial equivalence) to arrange 3 trapezoids with angles of $60^\circ$ and $120^\circ$ into an equilateral triangle: With $4$ trapezoids, I see two ways: With $5$ trapezoids, there are many more; I…
RavenclawPrefect
  • 11,664
  • 2
  • 19
  • 79
16
votes
1 answer

Does the "prime ant" ever backtrack?

A few mathematical questions have come up from the question "The prime ant " on the Programming Puzzles & Code Golf Stack Exchange. Here is how the prime ant is defined: Initially, we have an infinite array A containing all the integers >= 2 :…
Peter Kagey
  • 4,789
  • 9
  • 32
  • 80
14
votes
1 answer

Mistake in OEIS A103904?

The sequence OEIS A103904 is described as Number of perfect matchings of an $n \times (n+1)$ Aztec rectangle with the third vertex in the topmost row removed. Definition of $M \times N $ Aztec rectangle (one can see such a definition by C.…
Xuemei
  • 307
  • 1
  • 8
14
votes
4 answers

Why would you take the logarithmic derivative of a generating function?

Today, my climbing expedition scaled Mt. Sloane to request the Oracle's Extensive Insight into Sequences. The monks there had never heard of our plight, so they inscribed our query in mystical runes on a scrip of paper and took it into a room we…
algorithmshark
  • 1,445
  • 9
  • 18
13
votes
3 answers

How many different functions we have by only use of $\min$ and $\max$?

We can making many functions of three variable by only use and combining of $\min$ and $\max$ functions. But many of them are not different , like : $$\min(x,y,z)=\min(x,\min(y,z)),\quad\min(x,\max(x,y)) = \min(x,x) = \max(x,x)$$ How many…
user217174
1
2 3
…
11 12