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!)
A076505 3 people at a party are saying Hello to each other. Person 1 says Hello. Person 2 counts the times Hello has been said and says Hello twice that number. Person 3 says Hello 3 times the sum of Hello's and then it is Person 1 again. This is how many Hello's each person says. 1
1, 2, 9, 12, 48, 216, 288, 1152, 5184, 6912, 27648, 124416, 165888, 663552, 2985984, 3981312, 15925248, 71663616, 95551488, 382205952, 1719926784, 2293235712, 9172942848, 41278242816, 55037657088, 220150628352, 990677827584 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
For n>4, a(n) = a(n-3)*4!. - Rob Hoogers (chimera(AT)chimera.fol.nl), Jun 27 2004
a(n) = 2^i*3^j, with i=A064429(n-1), j=[n/3]+[n%3==0].
G.f.: x*(1-x)*(1+3*x+12*x^2)/(1-24*x^3). - Colin Barker, Jun 07 2012
MATHEMATICA
LinearRecurrence[{0, 0, 24}, {1, 2, 9, 12}, 30] (* Paolo Xausa, Apr 22 2024 *)
PROG
(PARI) mod 3(n)=if (i%3==0, 3, i%3) s=1; for (i=2, 30, print1(s*mod 3(i), ", "); s=s+s*mod 3(i))
CROSSREFS
Cf. A076506.
Sequence in context: A126977 A102237 A324571 * A218073 A129345 A216350
KEYWORD
nonn,easy,changed
AUTHOR
Jon Perry, Oct 15 2002
EXTENSIONS
More terms from Rob Hoogers (chimera(AT)chimera.fol.nl), Jun 27 2004
An incorrect comment was deleted, Aug 02 2010
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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)