login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A202951
Number of Nickerson-type partitions of [1,...,3n] into triples satisfying x+y=z.
3
1, 1, 0, 0, 6, 10, 0, 0, 700
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,5
LINKS
Table of n, a(n) for n=0..8.
R. S. Nickerson,
Problem E1845
, Amer. Math. Monthly, p. 81, 73 (1966).
R. S. Nickerson and D. C. B. Marsh,
E1845: A variant of Langford's Problem
, American Math. Monthly, 1967, 74, 591-595.
R. J. Nowakowski,
Generalizations of the Langford-Skolem problem
, M.S. Thesis, Dept. Math., Univ. Calgary, May 1975. [Scanned copy, with permission.]
CROSSREFS
Cf.
A108235
,
A202952
.
Sequence in context:
A159190
A236766
A004075
*
A316633
A295052
A343369
Adjacent sequences:
A202948
A202949
A202950
*
A202952
A202953
A202954
KEYWORD
nonn
,
more
AUTHOR
N. J. A. Sloane
, Dec 26 2011
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 April 23 06:58 EDT 2024. Contains 371906 sequences. (Running on oeis4.)