A328943 - OEIS

A328943

a(n) = 2 + (n mod 4).

2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3, 4, 5, 2, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

Terms of the simple continued fraction of (36+sqrt(1806))/34.

2345/9999=0.234523452345...

Partial sums are given by A130482(n) + 2*n + 2.

Example of a sequence where the largest of any four consecutive terms equals the sum of the two smallest.

LINKS

Michael De Vlieger, Table of n, a(n) for n = 0..10000

David Nacin, Van der Laan Sequences and a Conjecture on Padovan Numbers, J. Int. Seq., Vol. 26 (2023), Article 23.1.2.

Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 1).