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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049673 a(n) = (F(3n) + F(n))/3, where F = A000045 (the Fibonacci sequence). 2
0, 1, 3, 12, 49, 205, 864, 3653, 15463, 65484, 277365, 1174889, 4976832, 21082073, 89304891, 378301260, 1602509321, 6788337557, 28755857952, 121811766781, 516002920895, 2185823443596, 9259296684333, 39223010163217, 166151337308544, 703828359351025 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

From Peter Bala, May 29 2016: (Start)

This is an odd divisibility sequence, that is, if n divides m and n/m is odd then a(n) divides a(m). More generally, if r and s are positive integers such that r = s (mod 2) then the sequence Fibonacci(r*n) + Fibonacci(s*n) is an odd divisibility sequence. In the particular case that r is even and s = r + 2 then Fibonacci(r*n) + Fibonacci(s*n) is, in fact, a divisibility sequence. See for example A215466 and A273624. (End)

LINKS

Colin Barker, Table of n, a(n) for n = 0..1000

P. Bala, Lucas sequences and divisibility sequences

Index entries for linear recurrences with constant coefficients, signature (5,-2,-5,-1).

FORMULA

G.f.: x*(1-2*x-x^2) / ((x^2+4*x-1)*(x^2+x-1)). - R. J. Mathar, Oct 26 2015

a(n) = 5*a(n-1) - 2*a(n-2) - 5*a(n-3) - a(n-4) for n>3. - Wesley Ivan Hurt, Jun 01 2016

a(n) = ((-(1/2*(1-sqrt(5)))^n-(2-sqrt(5))^n+(1/2*(1+sqrt(5)))^n+(2+sqrt(5))^n))/(3*sqrt(5)). - Colin Barker, Jun 02 2016

MAPLE

with(combinat): A049673:=n->(fibonacci(3*n)+fibonacci(n))/3: seq(A049673(n), n=0..30); # Wesley Ivan Hurt, Jun 01 2016

MATHEMATICA

Table[(Fibonacci[3 n] + Fibonacci[n])/3, {n, 0, 30}] (* Wesley Ivan Hurt, Jun 01 2016 *)

PROG

(PARI) concat(0, Vec(x*(1-2*x-x^2)/((x^2+4*x-1)*(x^2+x-1)) + O(x^30))) \\ Colin Barker, Jun 02 2016

(MAGMA) [(Fibonacci(3*n)+Fibonacci(n))/3: n in [0..30]]; // Vincenzo Librandi, Jun 04 2016

CROSSREFS

Cf. A000045, A215466, A273624.

Sequence in context: A012772 A012864 A045890 * A052703 A151170 A151171

Adjacent sequences:  A049670 A049671 A049672 * A049674 A049675 A049676

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 19:20 EST 2016. Contains 278755 sequences.