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!)
A280523 a(n) = Fibonacci(2n + 1) - n. 4
1, 3, 10, 30, 84, 227, 603, 1589, 4172, 10936, 28646, 75013, 196405, 514215, 1346254, 3524562, 9227448, 24157799, 63245967, 165580121, 433494416, 1134903148, 2971215050, 7778742025, 20365011049, 53316291147, 139583862418 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Old (and equivalent) definition: these are the indices of records in the Fibonachos sequence A280521: the least k such that A280521(k) = n.
Conjecture: a(n) = A215004(2n - 2). - Peter Kagey. The conjecture is true. See link for analysis of connections with A215004 and A280521. - Nathan Fox, Jan 27 2017
Define the n-th Fibonacci compositions CF(n) by CF(1)={(1)}, CF(2)={(2)}, and CF(n) is 1 adjoined at the end of each composition in CF(n-1) union 2 adjoined to the end of each composition in CF(n-2). The union is disjoint, so |CF(n)| is the n-th Fibonacci number. Define the weight of a composition c by 2^(number of singletons in c). For example, 2122 has 1 singleton and weight 2. Let s(n) be the sum of the weights of CF(n). Conjecture: a(n)= s(2n+4)-s(2n+3). - George Beck, Jan 31 2020
LINKS
Murray Tannock, Equivalence classes of mesh patterns with a dominating pattern, MSc Thesis, Reykjavik Univ., May 2016. See Appendix B2
FORMULA
G.f.: -x*(-1+2*x-3*x^2+x^3) / ( (x^2-3*x+1)*(x-1)^2 ). - R. J. Mathar, Mar 11 2017
a(n) = 5*a(n-1)-8*a(n-2)+5*a(n-3)-a(n-4). - Wesley Ivan Hurt, Apr 26 2021
EXAMPLE
a(1) = 1 because A280521(1) = 1;
a(2) = 3 because A280521(3) = 2;
a(3) = 10 because A280521(10) = 3;
a(4) = 30 because A280521(30) = 4;
a(5) = 84 because A280521(84) = 5;
a(6) = 227 because A280521(227) = 6;
a(7) = 603 because A280521(603) = 7;
a(8) = 1589 because A280521(1589) = 8.
MATHEMATICA
Table[Fibonacci[2n + 1] - n, {n, 30}] (* Alonso del Arte, Jan 29 2017 *)
LinearRecurrence[{5, -8, 5, -1}, {1, 3, 10, 30}, 30] (* Harvey P. Dale, Feb 06 2024 *)
PROG
(PARI) F=vector(64, n, fibonacci(n+2)-1); \\ Resize as needed
A280521(n)=my(s); while(n, s++; t=setsearch(F, n, 1); if(t, n-=F[t-1], return(s))); s
first(n)=my(v=vector(n), k, t, mn=1, gaps=n); while(gaps, t=A280521(k++); if(t>=mn && t<=n && v[t]==0, v[t]=k; while(mn<=n && v[mn], mn++); print("a("t") = "k); gaps--)); v \\ Charles R Greathouse IV, Jan 04 2017
CROSSREFS
Sequence in context: A027256 A332360 A115515 * A117869 A092756 A027205
KEYWORD
nonn,easy
AUTHOR
Peter Kagey, Jan 04 2017
EXTENSIONS
Corrected and extended by Charles R Greathouse IV, Jan 04 2017
a(26) from Charles R Greathouse IV, Jan 09 2017
a(27) from Charles R Greathouse IV, Jan 16 2017
Replaced old definition by simple formula established by Nathan Fox. - N. J. A. Sloane, Jan 30 2017
STATUS
approved

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 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)