A075826 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A075826

n minus (number of letters in English name of n).

-4, -2, -1, -2, 0, 1, 3, 2, 3, 5, 7, 5, 6, 5, 6, 8, 9, 8, 10, 11, 14, 12, 13, 12, 14, 15, 17, 16, 17, 19, 24, 22, 23, 22, 24, 25, 27, 26, 27, 29, 35, 33, 34, 33, 35, 36, 38, 37, 38, 40, 45, 43, 44, 43, 45, 46, 48, 47, 48, 50, 55, 53, 54, 53, 55, 56, 58, 57, 58, 60, 63

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

a(n) < 0 for n < 4, a(n) = 0 for n = 4 and a(n) > 0 for n > 4. - Bernard Schott, Feb 11 2020

The French variant would be n - A167507(n) = (-4, -1, -2, -2, -2, 1, 3, 3, 4, 5, 7, 7, 7, 7, 6, 9, 11, ...). The German variant would be n - A007208(n) = (-3, -2, -1, 0, 1, 1, 1, 4, 5, 6, 8, 7, 5, 6, 7, 8, 9, 10, ...). - M. F. Hasler, Mar 02 2020

REFERENCES

GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See pages 49 and 214.

LINKS

Table of n, a(n) for n=0..70.

FORMULA

a(n) = n - A005589(n). - Michel Marcus, Feb 11 2020

EXAMPLE

Seven contains 5 letters, therefore a(7) = 7 - 5 = 2.

PROG

(PARI) A075826(n)=n-A005589(n) \\ M. F. Hasler, Mar 02 2020

CROSSREFS

Cf. A005589.