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 63938
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.
5
votes
0
answers
114
views
Hypergraphs with only disjoint perfect matchings
This sequence corresponds to the first seven entries of OEIS A001700. …
- 155
6
votes
1
answer
293
views
Why is the number of Hamiltonian Cycles of n-octahedron equivalent to the number of Perfect ...
In OEIS A003436, it is written that the number of inequivalent labeled Hamilton Cycles of an n-dimesnional Octahedron is the same as the number of Perfect Matchings in a the complement of the Cycle Graph … Unfortunatly, OEIS does not give further details. …
- 155
5
votes
0
answers
157
views
Dirichlet eta function and Stirling Permutations
According to OEIS A156919, the Stirling permutations were discovered while studying certain properties of the Dirichlet eta function. …
- 155