cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A008589 Multiples of 7.

Original entry on oeis.org

0, 7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 91, 98, 105, 112, 119, 126, 133, 140, 147, 154, 161, 168, 175, 182, 189, 196, 203, 210, 217, 224, 231, 238, 245, 252, 259, 266, 273, 280, 287, 294, 301, 308, 315, 322, 329, 336, 343, 350, 357, 364, 371, 378
Offset: 0

Views

Author

N. J. A. Sloane, Mar 15 1996

Keywords

Comments

Also the Engel expansion of exp(1/7); cf. A006784 for the Engel expansion definition. - Benoit Cloitre, Mar 03 2002
Complement of A047304; A082784(a(n))=1; A109720(a(n))=0. - Reinhard Zumkeller, Nov 30 2009
The most likely sum of digits to occur when randomly tossing n pairs of (fair) six-sided dice. - Dennis P. Walsh, Jan 26 2012

Examples

			For n=2, a(2)=14 because 14 is the most likely sum (of the possible sums 4, 5, ..., 24) to occur when tossing 2 pairs of six-sided dice. - _Dennis P. Walsh_, Jan 26 2012
		

Crossrefs

Programs

Formula

(floor(a(n)/10) - 2*(a(n) mod 10)) == 0 modulo 7, see A076309. - Reinhard Zumkeller, Oct 06 2002
a(n) = 7*n = 2*a(n-1)-a(n-2); G.f.: 7*x/(x-1)^2. - Vincenzo Librandi, Dec 24 2010
E.g.f.: 7*x*exp(x). - Ilya Gutkovskiy, May 11 2016