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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087150 Monotonically increasing sequence of least positive integers, a(1)=1, such that the self-convolution produces all squares. 1
1, 2, 6, 20, 40, 42, 54, 90, 168, 236, 406, 712, 1094, 1602, 2240, 2970, 3690, 4874, 5008, 5710, 8338, 9714, 10496, 11314, 12812, 19924, 27678, 37748, 49142, 55996, 71438, 92420, 104866, 110158, 128642, 143030, 151098, 158264, 208234, 213902 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

A087151(n)^2 = sum(k=1, n, a(k)*a(n-k+1)).

CROSSREFS

Cf. A087151.

Sequence in context: A353699 A202963 A130315 * A323724 A214307 A087134

Adjacent sequences: A087147 A087148 A087149 * A087151 A087152 A087153

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Aug 19 2003

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 November 28 05:56 EST 2022. Contains 358407 sequences. (Running on oeis4.)