|
Search: id:A119626
|
|
|
| A119626 |
|
Obtained from computing the difference in the number of inverted pairs of the first and the last cycles which in turn is obtained from a special(123)-avoiding permutation pattern. |
|
+0
2
|
|
| 6, 12, 30, 84, 246, 732, 2790, 8364, 25086, 75252, 225750, 677264, 2031786, 6095352, 18286050, 5485144, 164574426, 493723272, 1481169810, 4443509430, 13330528274, 39991584716, 89974754142, 269924262440, 809772787254
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The functions fn(x) generate primes while the formula (Cs-Ci,Pinverted)generates integer sequence outlined avove which is throughout divisible by 3
|
|
REFERENCES
|
Ibrahim A.A.(2004)Group-theoretic Interpretation of Bara'at al-Dhimmah models for Prayers that are not strictly Consecutive Mathematical association of Nigeria, Proceedings of the Annual National Conference:35-42
Ibrahim A.A.(2005) On the Combinatorics of A Five-element Sample Abacus, The Journal of Mathematical Association of Nigeria Vol. 32, No. 2B:410-415
Ibrahim A.A. (2005) On Wreath Product of Permutation Groups and Algebraic Properties of Bara'at Al-Dhimmah Models PhD. Thesis, Mathematics Department, UDUS, P.M.B. 2346, Sokoto-Nigeria
|
|
FORMULA
|
Formula is:(Cs,-C1,Pinverted)=3+3^n, n=1,2,3,..., Recurssion relation is:fn(x)=fn-1(x)+[fn-2(x)-fn-3(x)];f0(x)=5,f1(x)=7,f2(x)=11
|
|
EXAMPLE
|
Formula: For n=3; (Cs-C1,Pinverted)=3+3^3=3+27=30
Recursion: f3(x)=f2(x)+[f1(x)-f0(x)]=11+2=13
|
|
MAPLE
|
For x>=3 do write in f(x)=3+3^x write in end
|
|
CROSSREFS
|
Sequence in context: A122211 A015801 A073245 this_sequence A096356 A065992 A085611
Adjacent sequences: A119623 A119624 A119625 this_sequence A119627 A119628 A119629
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Aminu Alhaji Ibrahim (aminualhaji(AT)yahoo.co.uk), Jun 08 2006
|
|
|
Search completed in 0.002 seconds
|
