[go: up one dir, main page]

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!)
A189826 a(n) = (3^n-n)*(n-1) - 2^n*(n-2). 1
2, 7, 40, 199, 856, 3359, 12440, 44335, 153808, 523159, 1752928, 5804759, 19041608, 61981807, 200458504, 644783071, 2064276256, 6581953703, 20911793168, 66230028871, 209167217752, 658918365247, 2070973772920, 6495510239759, 20334154874096, 63545035094839 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Previous name was: Identity difference partial transformation semigroup, IDP_n is obtained by taking the absolute value of the difference between the max(Im(alpha)) and min(Im(alpha)) <= 1. The number of elements for each n is denoted by #IDP_n.
LINKS
Index entries for linear recurrences with constant coefficients, signature (13,-70,202,-337,325,-168,36).
FORMULA
a(n) = (3^n-n)*(n-1) - 2^n*(n-2).
G.f.: -x*(2 - 19*x + 89*x^2 - 235*x^3 + 329*x^4 - 210*x^5 + 36*x^6) / ( (3*x-1)^2 *(2*x-1)^2 *(x-1)^3 ). - R. J. Mathar, Jun 20 2011
EXAMPLE
For n=4, #IDP_n = 199.
MATHEMATICA
LinearRecurrence[{13, -70, 202, -337, 325, -168, 36}, {2, 7, 40, 199, 856, 3359, 12440}, 30] (* Harvey P. Dale, Apr 03 2016 *)
PROG
(Magma) [(3^n-n)*(n-1)-2^n*(n-2): n in [1..30]]; // Vincenzo Librandi, Jun 19 2011
(PARI) a(n) = (3^n-n)*(n-1)-2^n*(n-2); \\ Altug Alkan, Sep 20 2018
CROSSREFS
Sequence in context: A052443 A153744 A266422 * A069732 A346964 A277565
KEYWORD
nonn
AUTHOR
Adeniji, Adenike Apr 28 2011
EXTENSIONS
Simpler name using formula from Joerg Arndt, Sep 20 2018
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 August 29 06:09 EDT 2024. Contains 375510 sequences. (Running on oeis4.)