Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with oeis
Search options not deleted
user 85541
The acronym OEIS stands for the On-Line Encyclopedia of Integer Sequences, a well-known database of sequences of integers. It can be used for questions where this database is (or might be) relevant, mainly questions about particular sequences of integers. This tag is typically used in combination with other tags to make the scope of the question more precise; common examples of such tags include the top-level tags co.combinatorics and nt.number-theory.
1
vote
1
answer
223
views
OEIS Sequence A002846 and properties of matrix inverses
Sequence A002846 in https://oeis.org/A002846 (OEIS) gives, for each positive integer $n$, the number $a(n)$ of ways of transforming a set of $n$ indistinguishable objects into $n$ singletons via a sequence …
- 169
4
votes
Accepted
OEIS Sequence A002846 and properties of matrix inverses
Actually, this turned out to be embarrassingly simple. Let $M$ be such an $n\times{}n$ matrix and set $\mathbf{i}_n$ to be the column matrix with entries 1 to $n$ and $\mathbf{1}_n$ to be the column m …
- 169