login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A325869
Number of maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient.
9
1, 1, 1, 2, 3, 4, 6, 6, 6, 20, 32, 29, 57, 83, 113, 183, 373, 233, 549, 360
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,4
LINKS
Table of n, a(n) for n=1..20.
EXAMPLE
The a(1) = 1 through a(7) = 6 subsets:
{1} {1,2} {1,2,3} {1,3,4} {1,2,3,5} {1,2,5,6} {1,2,3,5,7}
{2,3,4} {1,3,4,5} {2,3,5,6} {1,2,5,6,7}
{2,3,4,5} {2,4,5,6} {2,3,4,5,7}
{1,3,4,5,6} {2,3,5,6,7}
{2,4,5,6,7}
{1,3,4,5,6,7}
MATHEMATICA
fasmax[y_]:=Complement[y, Union@@(Most[Subsets[#]]&)/@y];
Table[Length[fasmax[Select[Subsets[Range[n]], MemberQ[#, n]&&UnsameQ@@Divide@@@Subsets[#, {2}]&]]], {n, 10}]
CROSSREFS
Cf.
A025582
,
A067992
,
A108917
,
A143823
,
A196723
,
A196724
.
Cf.
A325853
,
A325854
,
A325858
,
A325860
,
A325861
,
A325864
,
A325868
.
Sequence in context:
A240809
A214322
A075527
*
A154257
A336406
A297351
Adjacent sequences:
A325866
A325867
A325868
*
A325870
A325871
A325872
KEYWORD
nonn
,
more
AUTHOR
Gus Wiseman
, Jun 02 2019
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 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)