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!)
A335693 A000904(n) - (-1)^n. 1
0, 1, 2, 14, 82, 593, 4820, 43980, 444612, 4934721, 59661254, 780531034, 10987095718, 165586966817, 2660378564776, 45392022568024, 819716784789192, 15620010933562689, 313219935456042954, 6593238655510464742, 145364470356686267258, 3349976056859294611697 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

A000179(n) = a(n-2) - a(n-4) for n >= 2. For example A000179(6) = 80 = 82 - 2 = a(4) - a(2).

REFERENCES

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. See q_n.

LINKS

Table of n, a(n) for n=0..21.

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124. [Scan of annotated copy]

CROSSREFS

Cf. A000166, A000904, A335691, A335692.

Sequence in context: A102401 A077461 A077444 * A138126 A268881 A053141

Adjacent sequences:  A335690 A335691 A335692 * A335694 A335695 A335696

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 20 2020

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 September 23 22:32 EDT 2020. Contains 337315 sequences. (Running on oeis4.)