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!)
A160080 Lodumo_4 of Fibonacci numbers. 1
0, 1, 5, 2, 3, 9, 4, 13, 17, 6, 7, 21, 8, 25, 29, 10, 11, 33, 12, 37, 41, 14, 15, 45, 16, 49, 53, 18, 19, 57, 20, 61, 65, 22, 23, 69, 24, 73, 77, 26, 27, 81, 28, 85, 89, 30, 31, 93, 32, 97, 101, 34, 35, 105, 36, 109, 113, 38, 39, 117, 40, 121, 125, 42, 43, 129, 44, 133, 137, 46 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Permutation of nonnegative numbers.
LINKS
OEIS wiki, Lodumo transform
FORMULA
a(n) = lod_4(A000045(n)).
From Philippe Deléham, Nov 30 2023: (Start)
a(n) = 2*a(n-6) - a(n-12) for n >= 12.
a(6*n) = 4*n, a(6*n+1) = 12*n+1, a(6*n+2) = 12*n+5, a(6*n+3) = 4*n+2, a(6*n+4) = 4*n+3, a(6*n+5) = 12*n+9.
G.f.: (x + 5*x^2 + 2*x^3 + 3*x^4 + 9*x^5 + 4*x^6 + 11*x^7 + 7*x^8 + 2*x^9 + x^10 + 3*x^11) / ((1-x)^2*(1+x+x^2)^2*(1+x^3)^2). (End)
CROSSREFS
Sequence in context: A133746 A176319 A261026 * A026247 A354236 A348779
KEYWORD
easy,nonn
AUTHOR
Philippe Deléham, May 01 2009
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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)