login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014369 a(n) = bcd, where n = C(b,3)+C(c,2)+C(d,1), b>c>d>=0. 1
310, 320, 321, 410, 420, 421, 430, 431, 432, 510, 520, 521, 530, 531, 532, 540, 541, 542, 543, 610, 620, 621, 630, 631, 632, 640, 641, 642, 643, 650, 651, 652, 653, 654, 710, 720, 721, 730, 731, 732, 740, 741, 742, 743, 750, 751, 752, 753 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

In the definition bcd means concatenation not multiplication. - Sean A. Irvine, Oct 18 2018

REFERENCES

W. Bruns and J. Herzog, Cohen-Macaulay Rings, Cambridge, 1993, p. 158.

LINKS

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

CROSSREFS

Sequence in context: A105841 A127456 A114484 * A273593 A051981 A134549

Adjacent sequences:  A014366 A014367 A014368 * A014370 A014371 A014372

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

a(1), a(4), a(10), a(20), a(35) modified to meet constraint b>c>d and more terms from Sean A. Irvine, Oct 18 2018

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 20 16:48 EDT 2019. Contains 327242 sequences. (Running on oeis4.)