Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047873
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047873 a(n) = max_{r=1_to_n-1} { ceiling(t[ t(n)-t(r-1) ] / (n-r+1)), t() = triangular numbers A000217. +0
2
1, 3, 8, 15, 27, 43, 65, 94, 130, 175, 229, 294, 369, 456, 557, 671, 800, 944, 1105, 1283, 1479, 1695, 1930, 2187, 2465, 2765, 3090, 3439, 3813, 4213, 4641, 5096, 5580, 6095, 6639, 7216, 7825, 8466, 9143, 9855 (list; graph; listen)
OFFSET

1,2

COMMENT

Another lower bound for Honaker triangle problem (A047837); conjectured to be exact value.

CROSSREFS

Cf. A047837, A047866.

Sequence in context: A034828 A081276 A047837 this_sequence A036419 A054107 A097589

Adjacent sequences: A047870 A047871 A047872 this_sequence A047874 A047875 A047876

KEYWORD

easy,nonn

AUTHOR

Mike Keith (domnei(AT)aol.com)

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research