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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176808 Triangle read by rows: T(n,m)=Floor[(n - 1)/m], 1<=m<=n. 1
0, 1, 0, 2, 1, 0, 3, 1, 1, 0, 4, 2, 1, 1, 0, 5, 2, 1, 1, 1, 0, 6, 3, 2, 1, 1, 1, 0, 7, 3, 2, 1, 1, 1, 1, 0, 8, 4, 2, 2, 1, 1, 1, 1, 0, 9, 4, 3, 2, 1, 1, 1, 1, 1, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

A010766 augmented by trailing zeros.

REFERENCES

F. S. Roberts, Applied Combinatorics, Prentice-Hall, 1984, p. 321.

LINKS

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

EXAMPLE

0;

1, 0;

2, 1, 0;

3, 1, 1, 0;

4, 2, 1, 1, 0;

5, 2, 1, 1, 1, 0;

6, 3, 2, 1, 1, 1, 0;

7, 3, 2, 1, 1, 1, 1, 0;

8, 4, 2, 2, 1, 1, 1, 1, 0;

9, 4, 3, 2, 1, 1, 1, 1, 1, 0;

MAPLE

A176808 := proc(n, m)

    floor((n-1)/m) ;

end proc: # R. J. Mathar, Feb 18 2016

MATHEMATICA

t[n_, m_] = Floor[(n - 1)/m];

Table[Table[t[n, m], {m, 1, n}], {n, 1, 10}];

Flatten[%]

CROSSREFS

Cf. A006218 (row sums), A174557.

Sequence in context: A218254 A285037 A264422 * A327029 A167192 A262114

Adjacent sequences:  A176805 A176806 A176807 * A176809 A176810 A176811

KEYWORD

nonn,tabl,easy

AUTHOR

Roger L. Bagula, Apr 26 2010

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 December 8 04:31 EST 2019. Contains 329850 sequences. (Running on oeis4.)