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!)
A185061 Position of the first occurrence of n in A193358 when it is considered to have the starting offset 1 instead of 0. 0

%I #26 Jun 13 2016 06:08:46

%S 1,2,5,3,11,7,19,13,29,21,41,31,55,43,71,57,89,73,109,91,131,111,155,

%T 133,181,157,209,183,239,211,271,241,305,273,341,307,379,343,419,381,

%U 461,421,505,463,551,507,599,553,649,601,701,651,755,703,811,757

%N Position of the first occurrence of n in A193358 when it is considered to have the starting offset 1 instead of 0.

%C Conjecture: Only odd numbers occur after 2. - _Antti Karttunen_, Jun 13 2013

%C Conjecture is true. - _Chai Wah Wu_, Jun 07 2016

%F a(n) = A193422(n)+1, or in other words, 1 + the position of the first occurrence of n in A193358. - _Antti Karttunen_, Jun 13 2013

%F From _Chai Wah Wu_, Jun 07 2016: (Start)

%F G.f.: x*(x^6 - x^5 - 3*x^4 + 4*x^3 - x^2 - x - 1)/((x - 1)^3*(x + 1)^2).

%F a(2*n) = n*(n-1) + 1 for n > 1.

%F a(2*n+1) = n*(n+3) + 1.

%F a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5) for n > 7. (End)

%t aux[0]=1;aux[1]=2;aux[n_]:=aux[n]=aux[n-aux[n-2]]+2;

%t a[i_]:={n=0; While[!(aux[n]==i),n++];n};

%t Flatten[Table[a[i]+1,{i,1,100}]]

%t (* corrected by _Robert Price_, Jun 06 2016 *)

%Y Cf. A193358.

%K nonn,easy

%O 1,2

%A _José María Grau Ribas_, Jan 22 2012

%E Description clarified to take heed of changed offset of A193358 by _Antti Karttunen_, Jun 13 2013

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 18 03:33 EDT 2024. Contains 371767 sequences. (Running on oeis4.)