login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A280520
Triangle read by rows: T(n,k) = number of increasing sequences of n positive integers with reciprocals adding up to k (k=1,2,...,A055980(n)).
4
1, 0, 1, 6, 1, 72, 6, 2320, 72, 245765, 2320, 151182379, 245765
OFFSET
1,4
COMMENTS
T(n,k) = 0 for all k > A055980(n).
For n=3,...,11, we have T(n,2) = T(n-1,1). However, T(12,2) > T(11,1).
Conjecture: for n in A115515 (i.e., A055980(n+1)=A055980(n)+1), the sequences being enumerated by T(n,A055980(n)) must start with 1. E.g., there is no 10-tuple (x_1,x_2,...,x_10) with 1 < x_1 < ... < x_10 and 1/x_1 + ... + 1/x_10 = 2 (=A055980(10)).
EXAMPLE
Triangle starts with:
n=1: 1
n=2: 0
n=3: 1
n=4: 6, 1
n=5: 72, 6
n=6: 2320, 72
n=7: 245765, 2320
n=8: 151182379, 245765
...
CROSSREFS
Cf. A280518 (row sums), A006585 (column k=1), A156869 (nondecreasing sequences), A280519 (ordered sequences).
Sequence in context: A266364 A356653 A009384 * A051151 A009330 A300512
KEYWORD
nonn,tabf,more
AUTHOR
Max Alekseyev, Jan 04 2017
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy