|
Search: id:A047350
|
|
|
| A047350 |
|
Numbers that are congruent to {1, 2, 4} mod 7. |
|
+0
1
|
|
| 1, 2, 4, 8, 9, 11, 15, 16, 18, 22, 23, 25, 29, 30, 32, 36, 37, 39, 43, 44, 46, 50, 51, 53, 57, 58, 60, 64, 65, 67, 71, 72, 74, 78, 79, 81, 85, 86, 88, 92, 93, 95, 99, 100, 102, 106, 107, 109, 113, 114, 116, 120, 121
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n+1) = a(n) + (a(n) mod 7). - Ben Thurston (benthurston27(AT)yahoo.com), Jan 09 2008
Also defined by: a(1)=1, and a(n)= smallest number larger than a(n-1) such that a(n)^3-a(n-1)^3 is divisible by 7 [Zak Seidov (zakseidov(AT)yahoo.com), Apr 21 2009]
Union of A047353 and A017029. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 28 2009]
|
|
FORMULA
|
a(n)=a(n-1)+a(n-3)-a(n-4) = a(n-3)+7. G.f.: x*(1+x+2*x^2+3*x^3)/((1+x+x^2)*(x-1)^2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 28 2009]
|
|
CROSSREFS
|
Sequence in context: A034036 A010410 A010459 this_sequence A010071 A035271 A044814
Adjacent sequences: A047347 A047348 A047349 this_sequence A047351 A047352 A047353
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
