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!)
A130829 2n+1 appears 2n times. 3

%I #18 Oct 18 2022 01:31:51

%S 3,3,5,5,5,5,7,7,7,7,7,7,9,9,9,9,9,9,9,9,11,11,11,11,11,11,11,11,11,

%T 11,13,13,13,13,13,13,13,13,13,13,13,13,15,15,15,15,15,15,15,15,15,15,

%U 15,15,15,15,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17

%N 2n+1 appears 2n times.

%F a(n) = 2*floor(sqrt(n)+1/2)+1. - _Mikael Aaltonen_, Jan 14 2015

%F From _Robert Israel_, Jan 14 2015: (Start)

%F G.f.: x/(1-x)*(1+2*sum(m>=0, x^(m*(m+1))) = x/(1-x)*(1+x^(-1/4)*theta_2(0,x)) where theta_2 is the second Jacobi theta function.

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

%F a(n) = A001670(n)+1.

%F (End)

%p seq(2*n+1 $ 2*n, n=1..10); # _Robert Israel_, Jan 14 2015

%o (Python)

%o from math import isqrt

%o def A130829(n): return 1|((m:=isqrt(n))+int((n-m*(m+1)<<2)>=1)<<1) # _Chai Wah Wu_, Oct 17 2022

%Y Cf. A001670, A002024, A003057.

%K nonn

%O 1,1

%A _Paul Curtz_, Jul 17 2007

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 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)