login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122195 Numbers that are the sum of exactly 3 sets of Fibonacci numbers. 5

%I #22 Sep 08 2022 08:45:28

%S 8,11,13,14,18,19,22,23,30,31,36,38,49,51,59,62,80,83,96,101,130,135,

%T 156,164,211,219,253,266,342,355,410,431,554,575,664,698,897,931,1075,

%U 1130,1452,1507,1740,1829,2350,2439,2816,2960,3803,3947,4557,4790,6154

%N Numbers that are the sum of exactly 3 sets of Fibonacci numbers.

%H G. C. Greubel, <a href="/A122195/b122195.txt">Table of n, a(n) for n = 1..1000</a>

%H M. Bicknell-Johnson & D. C. Fielder, <a href="http://www.fq.math.ca/Scanned/37-1/bicknell.pdf">The number of Representations of N Using Distinct Fibonacci Numbers, Counted by Recursive Formulas</a>, Fibonacci Quart. 37.1 (1999) pp. 47 ff.

%H Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibrep.html#sumoffib">Sumthing about Fibonacci Numbers</a>

%H <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1,0,0,1,-1).

%F G.f.: (8+3*x+2*x^2+x^3-4*x^4-2*x^5+x^6-5*x^8-3*x^9)/(1-x-x^4+x^5-x^8+x^9).

%F a(n) = a(n-4) + a(n-8) + 1.

%F a(0)=8, a(1)=11, a(2)=13, a(3)=18, then: a(4n) = A022318(n+3) = 2*A000045(n+5) + A000045(n+3) - 1, a(4n+1) = A022406(n+2) = 4*A000045(n+4) - 1, a(4n+2) = A022308(n+4) = 2*A000045(n+4) + A000045(n+6) - 1, a(4n+3) = 3*A000045(n+4) - 1, for n>=1.

%F a(n) = a(n-1) +a(n-4) -a(n-5) +a(n-8) -a(n-9). - _G. C. Greubel_, Jul 13 2019

%e 8 is the sum of only 3 sets of Fibonacci numbers: {8}, {3,5} and {1,2,5};

%e 11 is the sum of only {3,8}, {1,2,8}, {1,2,3,5}.

%p # first N terms:

%p series((8+3*x+2*x^2+x^3-4*x^4-2*x^5+x^6-5*x^8-3*x^9)/(x^9-x^8+x^5-x^4-x+1),x,N+1);

%t CoefficientList[Series[(8+3*x+2*x^2+x^3-4*x^4-2*x^5+x^6-5*x^8-3*x^9)/(1 - x-x^4+x^5-x^8+x^9), {x, 0, 60}], x] (* _G. C. Greubel_, Jul 13 2019 *)

%o (PARI) my(x='x+O('x^60)); Vec((8+3*x+2*x^2+x^3-4*x^4-2*x^5+x^6-5*x^8 -3*x^9)/(1-x-x^4+x^5-x^8+x^9)) \\ _G. C. Greubel_, Jul 13 2019

%o (Magma) R<x>:=PowerSeriesRing(Integers(), 60); Coefficients(R!( (8+3*x+2*x^2+x^3-4*x^4-2*x^5+x^6-5*x^8-3*x^9)/(1 - x-x^4+x^5-x^8+x^9) )); // _G. C. Greubel_, Jul 13 2019

%o (Sage) ((8+3*x+2*x^2+x^3-4*x^4-2*x^5+x^6-5*x^8-3*x^9)/(1 - x-x^4+x^5-x^8+x^9)).series(x, 60).coefficients(x, sparse=False) # _G. C. Greubel_, Jul 13 2019

%o (GAP) a:=[11,13,14,18,19,22,23,30];; for n in [9..60] do a[n]:=a[n-4]+a[n-8]+1; od; Concatenation([8], a); # _G. C. Greubel_, Jul 13 2019

%Y Cf. A000045, A000071, A013583, A000119, A122194.

%K nonn

%O 1,1

%A _Ron Knott_, Aug 25 2006, corrected Aug 29 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)