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!)
A081842 a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise. 0

%I #11 Apr 25 2019 07:08:57

%S 0,3,7,10,13,16,20,23,26,30,33,36,40,43,46,50,53,56,59,63,66,69,73,76,

%T 79,83,86,89,92,96,99,102,106,109,112,116,119,122,125,129,132,135,139,

%U 142,145,149,152,155,158,162,165,168,172,175,178,182,185,188,192,195

%N a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.

%F a(n)=floor(r*n-(4*r-1)/(r+1)) where r= (1/2) *(3+sqrt(13))

%t Module[{seq={0},n=2},Do[If[MemberQ[seq,n],AppendTo[seq,Last[seq]+4],AppendTo[seq,Last[seq]+3]];n++,{60}];seq] (* _Harvey P. Dale_, Nov 20 2012 *)

%K nonn

%O 1,2

%A _Benoit Cloitre_, Apr 11 2003

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 August 21 03:35 EDT 2024. Contains 375342 sequences. (Running on oeis4.)