A322425 - OEIS

A322425

Start with (1, 2, 3, 4, 5); if the sequence has n terms, extend it by appending a(n) copies of a(1..n-1): cf. "Look to the left" sequence A293630.

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

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

OFFSET

1,2

LINKS

Iain Fox, Table of n, a(n) for n = 1..10000

FORMULA

Lim_{n->infinity} (a(1) + a(2) + ... + a(n))/n = 2.55182072...

MATHEMATICA

Nest[Join[#, Flatten@ ConstantArray[Drop[#, -1], #[[-1]]] ] &, Range@ 5, 2] (* Michael De Vlieger, Dec 08 2018 *)

PROG

(PARI) gen(n, v=[1, 2, 3, 4, 5], w) = for(x=1, n, w=vector(#v-1, i, v[i]); for(y=1, v[#v], v=concat(v, w))); v

CROSSREFS