A130821 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A130821

2n-1 appears 2n times.

1, 1, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 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, 15, 15

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Table of n, a(n) for n=1..72.

FORMULA

a(n) = A131507(ceiling(n/2)-1). - Georg Fischer, Nov 28 2022

CROSSREFS

Cf. A131507.

Sequence in context: A118911 A190268 A111756 * A352226 A129756 A339971

Adjacent sequences: A130818 A130819 A130820 * A130822 A130823 A130824

KEYWORD

nonn

AUTHOR

Paul Curtz, Jul 17 2007

STATUS

approved