The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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
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, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = 2*floor(sqrt(n)+1/2)+1. - Mikael Aaltonen, Jan 14 2015
From Robert Israel, Jan 14 2015: (Start)
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.
a(2n) = a(2n-1) = 2*A002024(n)+1.
a(n) = A001670(n)+1.
(End)
MAPLE
seq(2*n+1 $ 2*n, n=1..10); # Robert Israel, Jan 14 2015
PROG
(Python)
from math import isqrt
def A130829(n): return 1|((m:=isqrt(n))+int((n-m*(m+1)<<2)>=1)<<1) # Chai Wah Wu, Oct 17 2022
CROSSREFS
Sequence in context: A349530 A251549 A129972 * A196386 A035158 A196172
KEYWORD
nonn
AUTHOR
Paul Curtz, Jul 17 2007
STATUS
approved

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 May 13 19:55 EDT 2024. Contains 372522 sequences. (Running on oeis4.)