The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083323 a(n) = 3^n - 2^n + 1. 22
 1, 2, 6, 20, 66, 212, 666, 2060, 6306, 19172, 58026, 175100, 527346, 1586132, 4766586, 14316140, 42981186, 129009092, 387158346, 1161737180, 3485735826, 10458256052, 31376865306, 94134790220, 282412759266, 847255055012 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Binomial transform of A000225 (if this starts 1,1,3,7....). Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are intersecting and for which either x is a proper subset of y or y is a proper subset of x, or 1) x = y. - Ross La Haye, Jan 10 2008 Let P(A) be the power set of an n-element set A and R be a relation on P(A) such that for all x, y of P(A), xRy if either 0) x is not a subset of y and y is not a subset of x and x and y are disjoint, or 1) x equals y. Then a(n) = |R|. - Ross La Haye, Mar 19 2009 LINKS M. H. Albert, M. D. Atkinson, and V. Vatter, Inflations of geometric grid classes: three case studies, arXiv:1209.0425 [math.CO], 2012. Ross La Haye, Binary Relations on the Power Set of an n-Element Set, Journal of Integer Sequences, Vol. 12 (2009), Article 09.2.6. Jay Pantone, The Enumeration of Permutations Avoiding 3124 and 4312, arXiv:1309.0832 [math.CO], 2013. Index entries for linear recurrences with constant coefficients, signature (6,-11,6). FORMULA G.f.: (1-4*x+5*x^2)/((1-x)*(1-2*x)*(1-3*x)). E.g.f.: exp(3*x) - exp(2*x) + exp(x). Row sums of triangle A134319. - Gary W. Adamson, Oct 19 2007 a(n) = 2*StirlingS2(n+1,3) + StirlingS2(n+1,2) + 1. - Ross La Haye, Jan 10 2008 a(n) = Sum_{k=0..n}(binomial(n,k)*A255047(k)). - Yuchun Ji, Feb 23 2019 EXAMPLE From Gus Wiseman, Dec 10 2019: (Start) Also the number of achiral set-systems on n vertices, where a set-system is achiral if it is not changed by any permutation of the covered vertices. For example, the a(0) = 1 through a(3) = 20 achiral set-systems are:   0  0    0           0      {1}  {1}         {1}           {2}         {2}           {12}        {3}           {1}{2}      {12}           {1}{2}{12}  {13}                       {23}                       {123}                       {1}{2}                       {1}{3}                       {2}{3}                       {1}{2}{3}                       {1}{2}{12}                       {1}{3}{13}                       {2}{3}{23}                       {12}{13}{23}                       {1}{2}{3}{123}                       {12}{13}{23}{123}                       {1}{2}{3}{12}{13}{23}                       {1}{2}{3}{12}{13}{23}{123} BII-numbers of these set-systems are A330217. Fully chiral set-systems are A330282, with covering case A330229. (End) MATHEMATICA LinearRecurrence[{6, -11, 6}, {1, 2, 6}, 30] (* G. C. Greubel, Feb 13 2019 *) PROG (PARI) a(n)=3^n-2^n+1 \\ Charles R Greathouse IV, Oct 07 2015 (MAGMA) [3^n-2^n+1: n in [0..30]]; // G. C. Greubel, Feb 13 2019 (Sage) [3^n-2^n+1 for n in range(30)] # G. C. Greubel, Feb 13 2019 (GAP) List([0..30], n -> 3^n-2^n+1); # G. C. Greubel, Feb 13 2019 CROSSREFS Cf. A134319, A028243, A000079. Cf. A000612, A003238, A330098, A330234. Sequence in context: A027061 A279460 A096487 * A174846 A111285 A052991 Adjacent sequences:  A083320 A083321 A083322 * A083324 A083325 A083326 KEYWORD nonn,easy AUTHOR Paul Barry, Apr 27 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 10:12 EST 2020. Contains 338679 sequences. (Running on oeis4.)
{"ft_lang_label":"__label__en","ft_lang_prob":0.57602173,"math_prob":0.97551256,"size":3074,"snap":"2020-45-2020-50","text_gpt3_token_len":1272,"char_repetition_ratio":0.09348534,"word_repetition_ratio":0.059479553,"special_character_ratio":0.5396877,"punctuation_ratio":0.21024968,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97937185,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-27T15:31:06Z\",\"WARC-Record-ID\":\"<urn:uuid:902cc69d-d2be-428d-b637-3dd2d488dec3>\",\"Content-Length\":\"28087\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c5a2020f-4a82-4a05-b356-167dee353d85>\",\"WARC-Concurrent-To\":\"<urn:uuid:b5019d18-d10a-4757-b7e4-20f7e4e2010f>\",\"WARC-IP-Address\":\"104.239.138.29\",\"WARC-Target-URI\":\"https://oeis.org/A083323\",\"WARC-Payload-Digest\":\"sha1:5BFTPWKC7UB6NQ3KVTNNBFRC2QWIQJTA\",\"WARC-Block-Digest\":\"sha1:N3RLZTHNBR5WMFQ2JED32UOUK7QAEL35\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141193221.49_warc_CC-MAIN-20201127131802-20201127161802-00481.warc.gz\"}"}