The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022907 The sequence m(n) in A022905. 5

%I

%S 0,2,5,8,14,20,29,38,53,68,89,110,140,170,209,248,302,356,425,494,584,

%T 674,785,896,1037,1178,1349,1520,1730,1940,2189,2438,2741,3044,3401,

%U 3758,4184,4610,5105,5600,6185,6770,7445,8120,8906,9692,10589

%N The sequence m(n) in A022905.

%H T. D. Noe, <a href="/A022907/b022907.txt">Table of n, a(n) for n=1..1000</a>

%H J. M. Dover, <a href="http://arxiv.org/abs/1606.08033">On two OEIS conjectures</a>, arXiv:1606.08033 [math.CO], 2016.

%F a(n) = 3 * A033485(n-1) - 1 = (3/2) * A000123(n-1) - 1, n>1. Proved by Jeremy Dover. - _Ralf Stephan_, Dec 08 2004

%t a123[n_] := a123[n] = If[n == 0, 1, a123[Floor[n/2]] + a123[n-1]];

%t a[n_] := If[n == 1, 0, (3/2) a123[n-1] - 1]; Array[a, 50] (* _Jean-François Alcover_, Dec 04 2018 *)

%K nonn

%O 1,2

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 27 06:18 EST 2022. Contains 350601 sequences. (Running on oeis4.)