A262570 - 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A262570

a(n) = A002704(n)/2.

1, 13, 469, 21400, 1065229, 55778797, 3020636341, 167544629317, 9461343754981, 541786421337805, 31372013730812824, 1833216802356228733, 107939805322734748117, 6396432908013911687437, 381139174656828902370421, 22819171231066917509661277 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	LINKS	`Table of n, a(n) for n=0..15.` `Alexander Rosa and Štefan Znám, A combinatorial problem in the theory of congruences (Russian with English summary), Mat.-Fys. Casopis Sloven. Akad. Vied 15 1965 49-59. [Annotated scanned copy.]` `Alexander Rosa and Štefan Znám, A remark on a combinatorial problem (Russian with English summary), Mat.-Fyz. Casopis Sloven. Akad. Vied 15 1965 313-316. [Annotated scanned copy] See Table 3.`
	CROSSREFS	`Cf. A002704, A262583, A262584.` `Sequence in context: A197749 A198154 A197234 * A012073 A012143 A173403` `Adjacent sequences: A262567 A262568 A262569 * A262571 A262572 A262573`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane, Oct 20 2015`
	EXTENSIONS	`More terms from R. J. Mathar, Oct 21 2015`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 10:52 EST 2023. Contains 367560 sequences. (Running on oeis4.)