|
| |
|
|
A008589
|
|
Multiples of 7.
|
|
29
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Also the Engel expansion of exp(1/7); cf. A006784 for the Engel expansion definition - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 03 2002
Complement of A047304; A082784(a(n))=1; A109720(a(n))=0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2009]
The most likely sum of digits to occur when randomly tossing n pairs of (fair) six-sided dice. [From Dennis Walsh, Jan 26 2012]
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 319
|
|
|
FORMULA
| (floor(a(n)/10) - 2*(a(n) mod 10)) == 0 modulo 7, see A076309. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 06 2002
a(n) = 7*n = 2*a(n-1)-a(n-2). G.f.: 7*x/(x-1)^2. [From Vincenzo Librandi, Dec 24 2010]
|
|
|
EXAMPLE
| 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. [From Dennis Walsh, Jan 26 2012]
|
|
|
MATHEMATICA
| Range[0, 1000, 7] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 27 2011 *)
|
|
|
CROSSREFS
| Cf. A008587, A008588, A016993.
Sequence in context: A044892 A004959 A020646 * A085130 A080194 A206717
Adjacent sequences: A008586 A008587 A008588 * A008590 A008591 A008592
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
