Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086707
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086707 Smallest mode of the sequences n/(n-k)*binomial(n,n-k) (see reference ). +0
1
0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22 (list; graph; listen)
OFFSET

1,6

REFERENCES

Moussa Benoumhani, "A Sequence of Binomial Coefficients Related to Lucas and Fibonacci Numbers", Journal of Integer Sequences, Article 03.2.1

FORMULA

a(n)=ceiling(1/10*(5*n-4-sqrt(5*n^2-4)))

CROSSREFS

Sequence in context: A050500 A076885 A051889 this_sequence A072912 A025786 A085886

Adjacent sequences: A086704 A086705 A086706 this_sequence A086708 A086709 A086710

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 28 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research