0,2

Also the Engel expansion of exp^(1/7); cf. A006784 for the Engel expansion definition - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 03 2002

Number of n permutations (n>=1) of 8 objects r, s, t, u, v, z, x, y, with repetition allowed, containing n-1 u's. Example: if n=1 then n-1=zero (0) u, a(1)=7 because we have r, s, t, v, z, x, y. if n=2 then n-1= one (1) u, a(2)=14 because we have ru, su, tu, vu, zu, xu, yu, ur, us, ut, uv, uz, ux, uy. if n=3 then n-1 =two (2) u, a(3)=21 because we have ruu, uru, uur, suu, usu, uus, tuu, utu, uut, vuu, uvu, uuv, zuu, uzu, uuz, xuu, uxu, uux, yuu, uyu, uuy, etc. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 17 2009]

Tanya Khovanova, Recursive Sequences

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 319

(floor(a(n)/10) - 2*(a(n) mod 10)) == 0 modulo 7, see A076309. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 06 2002

with(finance):seq(add(cashflows([1, 1, 5], 0 ), k=1..n), n=0..42); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008

Table[Binomial[n, 1]*7^1, {n, 0, 43}] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 17 2009]

(Other) sage: [i for i in range(305) if gcd(7, i) == 7] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 21 2009]

Sequence in context: A044892 A004959 A020646 this_sequence A085130 A080194 A043393

Adjacent sequences: A008586 A008587 A008588 this_sequence A008590 A008591 A008592

nonn

N. J. A. Sloane (njas(AT)research.att.com).