login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262567 a(n) = A002703(n)/2. 3
0, 0, 0, 1, 3, 7, 12, 23, 44, 81, 150, 281, 528, 991, 1871, 3541, 6719, 12787, 24384, 46599, 89240, 171196, 328959, 633101, 1220159, 2354687, 4549752, 8801161, 17043505, 33038207, 64103988, 124491775, 241969988, 470681347, 916259631, 1784921473, 3479467176, 6787108712, 13247128044, 25870861823 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,5

COMMENTS

A002703 is somewhat mysterious. Having four versions (A002703, this sequence, A262568, A262569) instead of one increases the chance that one of them will be found in a different context.

LINKS

Table of n, a(n) for n=3..42.

Rosa, Alexander; Znam, Stefan, A combinatorial problem in the theory of congruences. (Russian), Mat.-Fys. Casopis Sloven. Akad. Vied 15 1965 49-59. [Annotated scanned copy]

MAPLE

See A262568.

CROSSREFS

Cf. A002703, A262568, A262569.

Tables 1 and 2 of the first Rosa-Znam 1965 paper are A053632 and A178666 respectively.

Sequence in context: A034434 A243190 A256483 * A226229 A167491 A210185

Adjacent sequences:  A262564 A262565 A262566 * A262568 A262569 A262570

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Oct 20 2015

EXTENSIONS

More terms from R. J. Mathar, Oct 21 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)