This site is supported by donations to The OEIS Foundation.

# Clear-cut examples of keywords

This page provides clear-cut examples of keywords in the hope of helping new contributors have a better idea of which keywords apply to the sequences they're submitting. They will of course occasionally come up with sequences for which the keywords are not as clear-cut as these examples.

Over the years, there have been debates on SeqFan as to whether a given sequence in the OEIS does or does not merit such and such keyword. These cases present, depending on your viewpoint, delicious ambiguities or annoying problems which require the setting of arbitrary thresholds for their resolution.

## allocated

As soon as a contributor clicks on "Contribute a new sequence to the OEIS," the system finds the next available A-number and gives it this keyword. The name of the sequence is then changed to "Allocated for [contributor's name]." Other keywords will be bandied about during the initial draft edits phase, but this keyword will remain in effect until those edits are approved.

Contributors planning to submit several related sequences can get an "allocated" block, and a keyword:allocated lookup shows any currently allocated blocks. Contributors can tag their unused allocations as recycled.

## base

When the terms of a sequence are inextricably bound up with the representation of numbers in a specific conventional, positional base (quite often base 10, somewhat less often binary), then the sequence merits keyword:base. Algebraic expressions can be written for almost any sequence. But, as a rule of thumb, if it is much easier to define a sequence by reference to digits in a given base than it is with an algebraic expression, then we're talking about a base sequence. For our example:

Example: A029976, Palindromic primes in base 8. {... , 73, 89, 97, 113, 211, 227, 251, 349, ...} (that is, {... , 111, 131, 141, 323, 343, 373, 535, ...} )

To illustrate the rule of thumb, we could try writing an algebraic expression to define this sequence.

A029976: Prime numbers
 p
such that ${\displaystyle \textstyle {\prod _{i=0}^{\lfloor {\frac {{\mathcal {L}}-1}{2}}\rfloor }\delta _{d_{i}}^{d_{{\mathcal {L}}-i}}=1}}$, where
 L
is the number of base 8 digits
 p
has,
 d0
is the least significant digit of
 p
and
 dL − 1
is the most significant, and
 δ mn
is the Kronecker delta. Repunits were considered for the example, but the algebraic expression is quite simple:
 b n  −  1 b  −  1
. Less clear-cut examples of base sequences: sequences that look at multiple base representations (e.g., from binary to base
 n  −  1
), unconventional positional bases or conventional non-positional bases (phinary, Roman numerals).

## bref

Some sequences are so brief it's hard to do any analysis with them, lookup keyword:bref.

Example: A003135 ${\displaystyle \scriptstyle n!\,}$ is a nontrivial product of factorials. 9, 10, 16. It is conjectured that this list is complete.

Example: A007540 Wilson primes: primes p such that (p-1)! == -1 (mod p^2).

## changed

Older sequences that have been recently changed (within the past three weeks) get keyword:changed, and also new sequences edited soon after initial approval. This keyword is assigned or removed automatically by the system. One old sequence that can be counted on to have this keyword a lot of the time is A000040.

## cofr

Another way to have (usually irrational) constants in the OEIS is as simple continued fractions, which are given this keyword. The sequence can be finite (if the constant is rational) or periodic (as in the case of square roots). (The sequences of numerators and denominators for the convergents are sequences of fractions and thus given keyword:frac rather than keyword:cofr).

Example: A001203, the continued fraction expansion of ${\displaystyle \scriptstyle \pi \,}$

${\displaystyle 3+{\cfrac {1}{7+{\cfrac {1}{15+{\cfrac {1}{1+{\cfrac {1}{292+{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{2+\ddots }}}}}}}}}}}}}}}}\,}$

giving the sequence of partial quotients

{3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, 1, 84, ...}

## cons

The OEIS is a database of integer sequences, but important irrational constants can be entered, by conversion to a sequence of integers in a number of different ways. The most common way is as a decimal expansion: the base 10 digits become terms of the sequence. Once keyword:cons is approved for a particular sequence, the string "cons" becomes a link in the Keywords field, and users can click that link to see the constant written with a decimal point and no commas between the digits, and to put the constant through Plouffe's inverter.

Example: A000796 Decimal expansion of
 π
: {3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, ...} Keyword cons is not limited to decimal expansions of irrational constants. See for example A027606, Euler's constant
 e
in duodecimal and A021016, decimal expansion of 1/12. Constants are always listed as unsigned (keyword nonn) sequences.

The issue of offsets for these sequences has been a confusing one for many contributors. See OEIS format for decimal representation of constants for a detailed explanation, sometimes leading zeros are skipped.

## core

It would be major news if a new sequence was given this keyword. This keyword is for those core, indispensable sequences of mathematics. The prime numbers, the Fibonacci numbers, the partition numbers; besides these, there are about 180 other sequences with this keyword and most of those were added very early on in the history of the OEIS. It is a very small club: less than 0.1% of sequences in the OEIS have keyword:core.

Most sequences in the OEIS will undergo a fairly continual process of evolution long after the initial submission; these sequences are alive. Papers will be written about them, more efficient algorithms will be invented, new conjectures will be posed. Other sequences will most likely never be edited again. But these are not deadwood: they must be kept in the OEIS for some reason or other. Generally dead sequences point to "live" sequences.

One common reason is that they are typos in respected and/or well-known books, hence it is reasonable to assume that at least one person will look up such a sequence in the OEIS.

Another common reason is that of unwittingly duplicated sequences early in the history of the OEIS; the sequence has been in the OEIS for such a long time that there are books and journal articles which reference the A-number of the duplicated sequence and it would therefore be confusing if the A-number was recycled for a new sequence. For other examples lookup keyword:dead, as of 2020 the database contained about 1,650 dead sequences.

Example: A185444 Erroneous version of A061574: {–163, –67, –43, –19, –11, –7, –3, –2, –1, 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 22, 23, 29, 33, 37, 38, ...} (the cited book is missing 1, 14 and 31).

## dumb

This keyword is described as being for "unimportant sequences" in the help file, but there is an element of humor in the use of keyword:dumb. Also, it has been used for sequences that reference the OEIS itself in some way.

Example: A085808 Price is Right wheel. {15, 80, 35, 60, 20, 40, 75, 55, 95, 50, 85, 30, 65, 10, 45, 70, 25, 90, 5, 100}

Example: A111157 Numbers ${\displaystyle \scriptstyle n\,}$ such that sequence A_n in this database does not contain a prime. {4, 7, 12, 35, 56, 66, 82, ...}

Example: A316599 The nonnegative integers sorted by increasing width of bounding box when printing their decimal representation using the Arial font, and in case of ties, sorted by increasing value. {1, 7, 0, 3, 9, 8, 2, 6, 5, 4, 11, 71, 31, 51, 91, 81, ...}

## dupe

This keyword is included here only for historical reasons. It was used for duplicated sequences to be recycled soon, now covered by a rifo rationale on the list of deleted sequences. Already externally used dupes can be kept as dead.

Other historical keywords related to the old OEIS review process were done, huge, and part. In this process done could be the next step after uned, i.e., ready for approval and inclusion as new, roughly in the direction of the "reviewed" step today (after the "proposed" step and before the "approved" step). A huge sequence contained terms too big for ordinary FORTRAN or C tools, and part corresponded to a collection of partition-related sequences in the Index to OEIS.

Similarly keyword probation introduced in 2006 for tentatively approved sequences is not used anymore.

## easy

This keyword is for sequences that are easy to compute and to understand. Keyword lookups can be combined, e.g., keyword:easy keyword:more. Maybe keyword:easy keyword:obsc should yield no results, but there are no hard rules until additional keyword constraints are deployed.

Example: A008592 Multiples of 10: {10, 20, 30, 40, 50, 60, 70, 80, 90, 100, ...}

You could probably rattle off a hundred terms of this sequence without having to think too much about it. A115020 is also an easy sequence, but as it requires slightly more concentration, is not as clear an example as this one. Nevertheless, since we allow ourselves the use of computers nowadays, a sequence can be considered easy if it's easy for a computer but somewhat difficult for a human without the aid of a calculator. Few people today can compute square roots by hand, yet we consider a sequence like A010488, decimal expansion of ${\displaystyle \scriptstyle {\sqrt {33}}\,}$, easy (it's 5 point something, close to 6.)

## eigen

An eigensequence: a fixed sequence for some transformation - see the files transforms and transforms (2) for further information or lookup keyword:eigen for more examples.

Example: A000108 Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). Also called Segner numbers.

## fini

The rules for inclusion in A Handbook of Integer Sequences and The Encyclopedia of Integer Sequences forbade finite sequences. An exception was made for certain sequences not known for certain to be infinite, such as the Mersenne primes. The OEIS allows the inclusion of finite sequences, and they are tagged with keyword:fini. If practical, proof of the finiteness of the sequence should be given, or at least referenced. Generally, it is helpful to include a comment along the lines of "Last term is ${\displaystyle \scriptstyle a(x)\,=\,y\,}$."

Example: A056757: Cube of number of divisors is larger than the number. {2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, ...} This sequence has exactly 50967 terms, the largest one being 27935107200.

The largest prime number in the sequence is 7; obviously prime numbers only have two divisors and therefore ${\displaystyle \scriptstyle p\,>\,\tau (p)^{3}\,}$ for all ${\displaystyle \scriptstyle p\,>\,7\,}$. The largest semiprime in the sequence is 62. A proof of the finiteness of the sequence could perhaps be built along these lines.

If the sequence has a B-file attached that gives all the terms of the sequence, the B-file link should include the words "complete sequence" (see for example A001476).

## frac

A sequences of rational numbers, not all integers, is split into two sequences, one for the numerators and one for the denominators, and both are given keyword:frac. The fractions are all in lowest terms, though of necessity the integers in the sequence are rendered as ${\displaystyle \scriptstyle {\frac {m}{1}}\,}$.

Example: ${\displaystyle \scriptstyle \prod _{p|n}\left(1-{\frac {1}{p}}\right).\,}$ (This sequence pertains to the totient function.)

${\displaystyle 1,{\tfrac {1}{2}},{\tfrac {2}{3}},{\tfrac {1}{2}},{\tfrac {4}{5}},{\tfrac {1}{3}},{\tfrac {6}{7}},{\tfrac {1}{2}},\cdots \,}$

This is split into A076512 (numerators: {1, 1, 2, 1, 4, 1, 6, 1, 2, 2, 10, 1, 12, 3, 8, 1, 16, 1, ...}) and A109395 (denominators: {1, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 15, 2, 17, 3, ...})

For sequences of unit fractions, only the sequence of denominators need be added; the numerators are A000012.

## full

Some finite sequences are so short they can be given in full well within the usual four lines that is the maximum for most infinite sequences. It almost goes without saying that if a sequence has keyword full, it should also have keyword fini. The advice given above suggesting a comment about the last term does not apply here.

Example: A003173: Heegner numbers, imaginary quadratic fields with unique factorization (or class number 1.) {1, 2, 3, 7, 11, 19, 43, 67, 163}. That's it. That's all of them.

Since 2013 finite sequences that are given in full in the B-file also do merit keyword:full. Most of the sequence entries affected by this change have been taken care of by now. But for the purpose of giving a clear-cut example of this keyword, a finite sequence short enough to be given in full without recourse to a B-file remains a better example than one that does.

## hard

Perhaps this is the keyword over which there is the greatest amount of disagreement. It is agreed that many infinite sequences get harder to compute as the indices get large enough: for example, what is the ten googolth semiprime? But this alone is not enough to make a sequence hard; the keyword is by no means a measure of the growth of a sequence. We could obtain the ten millionth semiprime without too much effort. There are sequences in the OEIS for which we can't even get the tenth term. The formula for such a sequence could turn out to be quite simple, but since we don't know it, and not for lack of trying, it is just as unfathomable as if it were a difficult formula.

Therefore, for our clear-cut example, we should choose a sequence for which the difficulty is not just computational but also theoretical.

Example: A001220: Wieferich primes: primes ${\displaystyle \scriptstyle p\,}$ with the property that ${\displaystyle \scriptstyle p^{2}\,}$ divides ${\displaystyle \scriptstyle 2^{p-1}-1\,}$. Only two are known: 1093 and 3511. Brute force number crunching has shown there are no more up to ${\displaystyle \scriptstyle 6.7\times 10^{15}\,}$, and the third Wieferich prime may be discovered by a computer, but such a discovery would most likely be no help in formulating a theory to find the fourth Wieferich prime nor prove that there are no more if that is the case. Nor would it be any help in further searching by ruling out certain bigger primes from the search. Such a discovery may answer some of the questions there are about Wieferich primes but it would also raise new questions.

Keyword:hard often goes hand in hand with keyword:more.

## hear

This keyword was introduced in 2014 for sequences that are worth listening to, and keyword:hear is rendered as clickable hyperlink in the Keywords field, same idea as for cons and others. The link goes to the OEIS MIDI Player page with default settings for the sequence at hand.

Example: A144488: Ludwig van Beethoven's Bagatelle No. 25, "Für Elise".

Example: A281488: a(n) = -Sum_{d divides (n-2), 1 <= d < n} a(d).

## less

This doesn't mean that we want fewer terms of the sequence, but rather that we want to mark the sequence as less interesting. Some sequences are not that interesting, but it is believed that there is some small but significant possibility that they will be looked up by others than those who submitted them. By the other side of the coin, we don't want such sequences to be the very first result in a search that also yields other, potentially more interesting, results.

Of course there are also sequences that are so uninteresting that they will be rejected altogether. Lookup keyword:less for examples, as of 2017 there were also a few keyword:dumb keyword:less combinations. TBD: Is there a clear-cut semantic/technical difference between dumb and less?

Example: A144572, Primes of the form nonprime(prime(n)) + 1 (the first nonprime under this definition is 0) {2, 5, 11, 17, 41, 59, 73, 83, 97, ...}

If someone looks up "2, 5, 11, 17," odds are they are more interested in odd-indexed prime numbers (A031368), or maybe the first prime between two consecutive squares (A007491) than they are in primes of the form nonprime(prime(n)) + 1. As of 2011, this search brings up seven pages of results, and primes of the form nonprime(prime(n)) + 1 don't appear until the seventh page. However, if they search for "2, 5, 11, 17, 41, 59," then this could be the sequence they're looking for.

## look

Like cons and hear this keyword is a clickable link in the Keywords field; it is used on sequences, where a link to the page showing a pin plot and scatter plot is helpful. In 2014 keyword:look was introduced, it is unrelated to the old retired "look" (1997…2002).

Example: A260443 Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1).

## more

For one reason or another, some sequences in the OEIS don't have as many terms as we would like, indicated by keyword:more. In the case of a sequence that also has keyword hard we know what we're looking for but we don't where to look, nor in some cases whether it exists to be found. Or it could be the case that the original contributor computed as much as he could by hand and no one has gotten around to using a computer to extend the sequence.

Example: A123692 Primes ${\displaystyle p}$ such that ${\displaystyle p^{2}}$ divides ${\displaystyle 5^{p-1}-1}$. 2, 20771, 40487, 53471161, 1645333507, 6692367337, 188748146801. These numbers get large fairly quick, but presumably extending this sequence is just a matter of letting a computer search run long enough. In this example, the next term, if it exists, is larger than 10 14.

## mult

If in contributing a new sequence, you find yourself writing a comment such as "Volkov proved this sequence is multiplicative in 2005," then you should also add keyword:mult. As you already know, a function ${\displaystyle \scriptstyle f(n)\,}$ is multiplicative if ${\displaystyle \scriptstyle f(ab)\,=\,f(a)f(b)\,}$ when ${\displaystyle \scriptstyle \gcd(a,b)\,=\,1\,}$, and fully or completely multiplicative when the condition of coprimality is unnecessary. For the purpose of the keyword, there is no need to distinguish between multiplicative and fully multiplicative, but for the latter a comment to that effect may sometimes be appropriate.

Example: A184997: Number of distinct remainders that are possible when a safe prime ${\displaystyle \scriptstyle p\,}$ is divided by ${\displaystyle \scriptstyle n\,}$ (for ${\displaystyle \scriptstyle p\,>\,2n+1\,}$). {1, 1, 1, 1, 3, 1, 5, 2, 3, 3, 9, 1, 11, 5, 3, 4, 15, 3, 17, ...} One of the comments in the entry references the Chinese remainder theorem in saying the sequence is multiplicative.

## new

Once a new sequence is approved, the system automatically gives it keyword:new, which remains in effect for about a couple of weeks.

## nice

For "an exceptionally nice sequence." Generally, you should not assign keyword:nice to new sequences you submit (unless of course there was a discussion prior somewhere, like on SeqFan, where everyone agreed it merits the keyword), but of course you can suggest to the editors, e.g., in an edit comment, that the sequence should have the keyword.

Example: A167408, orderly numbers: a number ${\displaystyle n}$ is orderly if there exists some number ${\displaystyle k>\tau (n)}$ such that the set of the divisors of ${\displaystyle n}$ is congruent to the set ${\displaystyle \{1,2,\cdots ,\tau (n)\}\mod k}$. 1, 2, 5, 7, 8, 9, 11, 12, 13, 17, 19, 20, 23, 27, 29, 31, 37, 38, 41, 43, 47, ...

There was great surprise on SeqFan that no one before Andrew Weimholt had thought of this sequence, and then unanimous agreement that it is a nice sequence.

## nonn

This keyword is for sequences containing no negative terms, at least not within term visibility. The system will automatically assign it if applicable, but it doesn't hurt to understand its raison d'être.

Example: A000290, ${\displaystyle \scriptstyle n^{2}\,}$, with ${\displaystyle \scriptstyle n\,\in \,\mathbb {Z} \,}$: {0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, ...}

Even if we allow negative ${\displaystyle \scriptstyle n,\,n^{2}\,}$ is still positive (or 0 in the case of 0).

Remember: the computer knows the signs of only the terms you enter; it can't figure out the theoretical underpinnings of the sequence, much less determine if it contains negative terms beyond those you enter. If necessary, you can delete "nonn" and type in "sign" instead.

## obsc

Abbreviation for obscure, keyword:obsc indicates that a description is known, but it may be difficult to understand or not very enlightening. (If no description at all is known for the sequence, keyword:unkn should be used.)

Example: A086267, ${\displaystyle a(n)=3+(H(n)\mod 6)+\lfloor r\rfloor }$ where ${\displaystyle H(n)}$ is the ${\displaystyle n}$th number in the Hofstadter Q-sequence and ${\displaystyle r={\frac {H(n)-2H(n+1)+H(n+2)-4}{H(n)}}}$

The description, though convoluted, is at least clear enough that others can reproduce the original contributor's numbers.

The keyword:obsc may also indicate obscure comments, or comments / programs / etc. for which the connection with the definition of the sequence is unclear. In these cases, keyword:uned may also be appropriate.

Remark: There are cases where both, keyword:obsc and keyword:unkn are given, and where only one of the two is inappropriate.

## recycled

When the editors agree that a new proposed sequence is not worth adding to the OEIS, an editor blanks the entry leaving only the keyword line with keyword:recycled. The A-number then becomes available for allocation for another new sequence, also see deleted sequences.

## sign

This keyword is generally for sequences containing some negative terms. (If the sequence is all negative terms, then you could just multiply all terms by –1 and amend the definition accordingly; getting rid of all those minus signs might allow you to put in maybe a couple dozen more terms without having a B-file.)

Example: A100700 n-th Fibonacci number minus n-th prime number: {–1, –2, –3, –4, –6, –5, –4, 2, 11, 26, 58, 107, ...}

As you may have surmised from the explanation of keyword nonn, the system will automatically assign keyword sign if you enter minus signs into the Data field. But if the sequence contains negative terms only beyond term visibility, then you have to explicitly assign keyword sign. Much less clear-cut are those cases where sequences are conjectured to contain negative terms; in such a case a comment should be entered to that effect.

## tabf

Tables with irregular row lengths, i.e., not 1, 2, 3, …, can get keyword:tabf. Unlike tabl this keyword does not result in a link to table representations.

Example: A027746 Triangle in which first row is 1, ${\displaystyle n}$-th row (${\displaystyle n>1}$) gives prime factors of ${\displaystyle n}$ with repetition.

1 2  3  2  5  2  7  2  3  2 11  2 13  2  3  2 17  2 19  2  3  2 23  2  5
2     3     2  3  5     2     7  5  2     3     2  7 11     2  5
2           3           2     3     5           2
2                       3


As you can see, a row with only one column (23) can be preceded by a row with two columns (2 and 11 for 22) and followed by a row with four columns (2 2 2 3 for 24).

## tabl

Regular tables with 1, 2, 3, … members in each row can get keyword:tabl, resulting in a clickable link in the Keywords field to table representations.

Example: A007318 Pascal’s triangle read by rows:
C (n, k) = (  nk  ) =
 n! k! (n  −  k)!
, 0   ≤   k   ≤   n.

Pascal’s triangle
 n

 d  = 0
(  nd  ) = 2n

 n

 2 n

0   1
1
1   1 1
2
2   1 2 1
4
3   1 3 3 1
8
4   1 4 6 4 1
16
5 1 5 10 10 5 1
32
6   1 6 15 20 15 6 1
64
7   1 7 21 35 35 21 7 1
128
8   1 8 28 56 70 56 28 8 1
256
9   1 9 36 84 126 126 84 36 9 1
512
10 1 10 45 120 210 252 210 120 45 10 1
1024
11   1 11 55 165 330 462 462 330 165 55 11 1
2048
12   1 12 66 220 495 792 924 792 495 220 66 12 1
4096

 k = 0

1
2
3
4
5
6
7
8
9
10
11
12

The table link shows the sequence formatted as a triangular array, then a square array and an upper right triangle.

## uned

In order to avoid an insurmountable backlog under the old system, some entries were added to the OEIS unedited. The sequences were interesting, but the presentation very lacking. Over time, these have been edited some time after being first added, and keyword:uned is accordingly removed. There remain quite a few unedited entries in the OEIS today.

But there is no good reason why this keyword should be given to any new sequences. Even after the first time you signal that your new entry is ready to be looked at by the Editors, there is a window of time to change your mind and tweak the entry. Then, once the Editors start looking at it, they may send it back to you for further adjustments if necessary. Under our new system, this is all managed very smoothly, and the closest we come to having a serious backlog is after holidays.

## unkn

When people cannot guess how a particular sequence of numbers is defined, they turn to the OEIS. But what happens when the Editors of the OEIS don't know either? The sequence is then usually added to the OEIS but given keyword:unkn, in the hope that someone will come along who does know the answer. For such a sequence, the original contributor should add as much information in the entry as is known, i.e. what is its provenance?: Where was the sequence found? Was an incorrect definition given for it? If it was part of a quiz, what were the other sequences in the quiz?

## walk

Some sequences concern walks through a lattice of specified shape, size and/or dimensions. Sequences pertaining to paths and trails should also have keyword:walk.

Example: A000984 Central binomial coefficients: binomial(2*n,n) = (2*n)!/(n!)^2.

## word

What interesting correlations are there between numbers and the words for numbers in a given natural language (such as Italian or Japanese)? Some sequences look at these relationships, so they get keyword:word.

Example: A001166, smallest natural number requiring ${\displaystyle n}$ letters in English. 1 (one), 4 (four), 3 (three), 11 (eleven), 15 (fifteen), 13 (thirteen), 17 (seventeen), 24 (twenty-four), 23 (twenty-three), 73 (seventy-three), etc.

Comments are in order when regional variances affect the terms of the sequence. Depending on where in the French-speaking world you go, 80 is "quatre-vingts," "huitante" or "octante," to give just one example.