This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A170732 G.f.: (1+x)/(1 - 12*x). 51
 1, 13, 156, 1872, 22464, 269568, 3234816, 38817792, 465813504, 5589762048, 67077144576, 804925734912, 9659108818944, 115909305827328, 1390911669927936, 16690940039135232, 200291280469622784, 2403495365635473408, 28841944387625680896, 346103332651508170752 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS For n >= 1, a(n) equals the number of words of length n-1 on the alphabet {0,1,...,12} with no two adjacent letters identical. - Milan Janjic, Jan 31 2015 LINKS Kenny Lau, Table of n, a(n) for n = 0..926 M. Janjic, On Linear Recurrence Equations Arising from Compositions of Positive Integers, J. Int. Seq. 18 (2015) # 15.4.7. Index entries for linear recurrences with constant coefficients, signature (12). FORMULA a(0)=1; for n > 0, a(n) = 13*12^(n-1). - Vincenzo Librandi, Dec 05 2009 MATHEMATICA Join[{1}, 13*12^Range[0, 25]] (* Vladimir Joseph Stephan Orlovsky, Jul 11 2011 *) PROG (PARI) a(n)=if(n, 13*12^(n-1), 1) \\ Charles R Greathouse IV, Jul 01 2016 (Python) for i in range(1001):print(i, 13*12**(i-1) if i>0 else 1) # Kenny Lau, Aug 01 2017 CROSSREFS Cf. A003953, A003954. Sequence in context: A170598 A170646 A170694 * A250210 A142104 A140020 Adjacent sequences:  A170729 A170730 A170731 * A170733 A170734 A170735 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Dec 05 2009 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 September 17 19:16 EDT 2019. Contains 327137 sequences. (Running on oeis4.)