login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047350 Numbers that are congruent to {1, 2, 4} mod 7. 0
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; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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]

Indices of the even numbers in the Padovan sequence. - Francesco Daddi (francesco.daddi(AT)libero.it), Jul 31 2011

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (1,0,1,-1).

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]

PROG

(PARI) a(n)=n\3*7+[-3, 1, 2][n%3+1] \\ Charles R Greathouse IV, Jul 31 2011

CROSSREFS

Cf. A134720, A000931.

Sequence in context: A034036 A010410 A010459 * A190723 A010071 A035271

Adjacent sequences:  A047347 A047348 A047349 * A047351 A047352 A047353

KEYWORD

nonn,easy

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 16:39 EST 2012. Contains 205823 sequences.