|
Search: id:A017077
|
|
| |
|
| 1, 9, 17, 25, 33, 41, 49, 57, 65, 73, 81, 89, 97, 105, 113, 121, 129, 137, 145, 153, 161, 169, 177, 185, 193, 201, 209, 217, 225, 233, 241, 249, 257, 265, 273, 281, 289, 297, 305, 313, 321, 329, 337, 345, 353, 361
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Numbers n such that n=1 mod(8) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Sep 08 2009]
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)= 8*n+1, n>=0. G.f.: (1+7*x)/(1-x)^2.
a(n+1)=A004768(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 28 2008
|
|
MAPLE
|
with(finance):seq(add(cashflows([2, 2, 4], 0 ), k=1..n)+1, n=0..44); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008
|
|
PROGRAM
|
(Other) sage: [i+1 for i in range(365) if gcd(i, 8) == 8] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
|
|
CROSSREFS
|
Cf. A093565 ((8, 1) Pascal, column m=1).
Cf. A004768.
Sequence in context: A144752 A073160 A143850 this_sequence A004768 A035198 A056233
Adjacent sequences: A017074 A017075 A017076 this_sequence A017078 A017079 A017080
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
