login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028307 Form a triangle with n numbers in top row; all other numbers are the sum of their parents. E.g.: 4 1 2 7; 5 3 9; 8 12; 20. The numbers must be positive and distinct and the final number is to be minimized. Sequence gives final number. 5
1, 3, 8, 20, 43, 98, 212, 465, 1000, 2144, 4497, 9504, 19872, 41455, 85356, 178630, 363467, 757085, 1541998, 3183600, 6515066, 13357593, 27432649, 55914902, 114683858, 233517515, 478061719, 972479046, 1986013932 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Suggested by Problem 401 of the All-Soviet-Union Mathematical Competitions 1961-1986. Two different links are available for this collection.
LINKS
Mauro Fiorentini, Further comments
FORMULA
From A.H.M. Smeets, Feb 25 2022: (Start)
a(n) > 2*a(n-1). Proof: Let x, y be the numbers in the second last row, then x >= a(n-1), y >= a(n-1) and x != y, so a(n) = x + y > 2*a(n-1).
It seems that a(n) > (4/3)*(2*a(n-1)-a(n-2)). (End)
EXAMPLE
Solutions for n = 1, 2, ... are:
1;
1, 2;
2, 1, 4;
4, 1, 2, 7;
7, 2, 1, 4, 6;
8, 6, 1, 3, 2, 10;
...
CROSSREFS
Sequence in context: A182735 A135565 A139488 * A027298 A000236 A109327
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
More terms from the author, Jul 03 2001
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 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)