The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A131507

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A131507

2n+1 appears n+1 times.
(history; published version)

#35 by Alois P. Heinz at Sun Oct 20 10:25:25 EDT 2019

STATUS

editing

approved

#34 by Alois P. Heinz at Sun Oct 20 10:25:21 EDT 2019

DATA

1, 3, 3, 5, 5, 5, 7, 7, 7, 7, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23

STATUS

approved

editing

#33 by Alois P. Heinz at Sun Oct 20 10:23:23 EDT 2019

STATUS

proposed

approved

#32 by Ridouane Oudra at Sun Oct 20 10:10:59 EDT 2019

STATUS

editing

proposed

#31 by Ridouane Oudra at Sun Oct 20 10:09:19 EDT 2019

FORMULA

a(n) = 2*floor(sqrt(2n+1)+1/2) - 1 = 2*A002024(n) - 1. - Ridouane Oudra, Oct 20 2019

#30 by Ridouane Oudra at Sun Oct 20 10:04:39 EDT 2019

FORMULA

a(n) = 2*floor(sqrt(2n+1)+1/2) - 1 = 2*A002024(n) - 1. - Ridouane Oudra, Oct 20 2019

MAPLE

seq(2*floor(sqrt(2*n+1)+1/2)-1, n=0..70); # Ridouane Oudra, Oct 20 2019

STATUS

approved

editing

#29 by Reinhard Zumkeller at Sun Nov 15 17:11:43 EST 2015

STATUS

editing

approved

#28 by Reinhard Zumkeller at Sat Nov 14 13:15:25 EST 2015

CROSSREFS

Cf. A001650.

STATUS

approved

editing

#27 by Bruno Berselli at Fri Nov 06 04:00:44 EST 2015

STATUS

proposed

approved

#26 by Jean-François Alcover at Fri Nov 06 03:54:15 EST 2015

STATUS

editing

proposed