Submit New Sequence to On-Line Encyclopedia of Integer Sequences

Sending in a New Sequence to The On-Line Encyclopedia of Integer Sequences

If you know of a sequence that is not in the OEIS and is interesting, please submit it using this page and it will (probably) be added.

[To add something to an existing sequence (more terms, a comment, formula, example, reference, link, program, etc.), please use SubmitA.html.
You can also use SubmitA.html to make corrections to the TERMS of a sequence.
To suggest a CORRECTION to anything except the terms in the sequence, use SubmitC.html.
You can also use SubmitC.html to edit a sequence.
To contribute a b-FILE, giving an extended list of terms, see SubmitB.html.]

Reasons for sending in a new sequence:

If it is a sequence you have personally discovered, this stakes your claim to it.
In any case your name is immortalized as the person who sent it in.
The next person who looks it up will be grateful to you for doing so.

IMPORTANT: Thousands of people use the sequence database every day.
Please take great care that the terms you send are absolutely correct.
The standards are those of a mathematics reference work.

Instructions: Include a brief description and if possible enough terms to fill 3 lines on the screen. In general a minimum of 4 terms are required.

Note that, to be included in the database, the sequence should:

consist of integers (though sequences of fractions can be entered as a pair of sequences giving respectively the numerators and denominators)
be infinite - though there are many exceptions to this rule (even various sequences of subway stops are in the table now)
be interesting

If you are going to submit several related sequences and would like some A-numbers so you can insert cross-references, click here!

Submitting a New Sequence:

Please enter your name (required):
Please enter your email address (required):

Since this is a scientific database, anonymous submissions cannot be accepted.
Your email address will be disguised before it appears in the entry.
If you are a regular contributor, that is, if the program recognizes your email address, you will receive an email copy of this submission.
Please give just one email address, even if there is more than one name.

Do you have an A-number (from the dispenser) for the new sequence?
No. An A-number will be automatically assigned when you finally click Submit.
Yes. Please enter the A-number here:

Enter the initial terms of the sequence here (required):
Entries may be separated by commas or spaces. Include signs.
Entries usually give at most 200 characters. If you have more terms than this, please consider also sending a b-file: see here for instructions.
Example: 1, -24, 252, -1472, 4830, -6048, -16744, 84480, -113643, -115920
(First, double-check that the sequence really is new by omitting the first term and looking it up in the OEIS!)

Enter a short description or definition of the sequence (required):
If necessary, you can add more details in the Comments section below.
Example: Numbers n with property that ....

What is the "offset"? This is the value of the "lead index" or "subscript" of the initial term.
(For example, if the sequence counts graphs on n nodes with some property, what is the first value of n? For a list, use offset 1.)
(Just enter one number, the second offset will be added automatically.)

In the following windows, to get a hard line break, end the line with the two-character symbol \Q ("backslash Q").
Otherwise lines will be merged together.
You should do this in any case after entering about 500 characters, for aesthetic reasons and to avoid lines being truncated.
To get fixed-width font in the wiki display, begin each line with a dot (see A000011 for an example).

Enter any additional comments:
Example: a(n) is also the number of Jones graphs on n nodes.

Give up to 3 references to books, journals, etc.:
Examples: (Book) H. J. Smith and A. B. Todd, Title, Publisher, Year, pages xxx-yyy.
(Journal) H. J. Smith and A. B. Todd, Article title, Journal Name, 16 (2001), 794-797.

Give up to 3 links to web sites:
Examples: N. J. A. Sloane and J. A. Sellers, <a href="http://arXiv.org/abs/math.CO/0312418">On non-squashing partitions</a>, Discrete Math., 294 (2005), 259-274.
Wikipedia, <a href="http://en.wikipedia.org/wiki/Mobius_function">Moebius function</a>
T. D. Noe, <a href="b000010.txt">Table of n, a(n) for n = 1..10000</a>
Author, <a href="http://www.etc....">Title</a>

Give any formulae, recurrences, generating functions, etc.:
Examples: a(n) = n^3 + 17*n - 1. G.f.: (3/4)*x^3/((1-x)*(1+2*x+x^3)).

Give example(s) to illustrate the initial terms:
Example: For n = 3 the a(3) = 5 solutions are ...

Give a program to generate the sequence:
For Python use dots instead of leading spaces and blank lines!

Give cross-references to other sequences
Example: Cf. A987654, A987655. Equals twice A000108. Row sums of triangle A123456.

Select keywords: see the help file for more information.

nonn sign base bref cofr cons dumb easy eigen fini

frac full hard more mult nice tabf tabl unkn word

(You must preview once before you can submit.)

AT&T Labs Research