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!)
A086335 a(n) = a((n - a(n-1))*(1-mod(n, 2))+a(n-1)*(mod(n, 2))) + a((n - a(n-2))*(1-mod(n, 2)) +(n-a(n-1))*(mod(n, 2))) with a(1) = a(2) = 1. 4

%I #15 Dec 05 2022 06:35:26

%S 1,1,2,3,3,4,5,5,6,6,7,7,9,8,10,9,11,11,12,11,13,13,15,13,16,15,17,16,

%T 18,15,19,20,20,16,21,21,22,20,23,22,25,22,26,24,26,24,28,24,29,28,31,

%U 26,32,29,33,32,36,28,35,36,37,31,39,36,39,32,41,38,39,39,43,38,41,41

%N a(n) = a((n - a(n-1))*(1-mod(n, 2))+a(n-1)*(mod(n, 2))) + a((n - a(n-2))*(1-mod(n, 2)) +(n-a(n-1))*(mod(n, 2))) with a(1) = a(2) = 1.

%t Hc[n_Integer?Positive] := Hc[n] =Hc[(n - Hc[n-1])*(1-Mod[n, 2])+Hc[n-1]*(Mod[n, 2])] + Hc[(n - Hc[n-2])*(1-Mod[n, 2])+(n-Hc[n-1])*(Mod[n, 2])]

%t Hc[1] = Hc[2] = 1

%t Terms = 60

%t Table[Hc[n], {n, 1, Terms }]

%Y Cf. A004001, A005185. Complement gives A086451.

%K nonn

%O 1,3

%A _Roger L. Bagula_, Sep 01 2003

%E Edited by _N. J. A. Sloane_, May 25 2006

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 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)