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!)
A297443 a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) + 3*a(n-4) - 3*a(n-5), where a(0) = 1, a(1) = 3, a(2) = 6, a(3) = 11, a(4) = 20, a(5) = 33. 2
1, 3, 6, 11, 20, 33, 60, 101, 182, 303, 546, 911, 1640, 2733, 4920, 8201, 14762, 24603, 44286, 73811, 132860, 221433, 398580, 664301, 1195742, 1992903, 3587226, 5978711, 10761680, 17936133, 32285040, 53808401, 96855122, 161425203, 290565366, 484275611 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Conjecture: a(n) = least positive whose base-3 total variation is n; see A297440.
LINKS
FORMULA
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) + 3*a(n-4) - 3*a(n-5), where a(0) = 1, a(1) = 3, a(2) = 6, a(3) = 11, a(4) = 20, a(5) = 33.
G.f.: (1 + 2*x + x^2 + x^3 - 3*x^5) / ((1 - x)*(1 + x^2)*(1 - 3*x^2)). - Corrected by Colin Barker, Jan 21 2018
MATHEMATICA
Join[{1}, LinearRecurrence[{1, 2, -2, 3, -3}, {3, 6, 11, 20, 33}, 40]]
PROG
(PARI) Vec((1 + 2*x + x^2 + x^3 - 3*x^5) / ((1 - x)*(1 + x^2)*(1 - 3*x^2)) + O(x^40)) \\ Colin Barker, Jan 21 2018
CROSSREFS
Cf. A297440.
Sequence in context: A320850 A180086 A116365 * A185083 A208851 A182845
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jan 21 2018
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 18 03:33 EDT 2024. Contains 371767 sequences. (Running on oeis4.)