Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001023
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001023 Powers of 14.
(Formerly M4949 N2120)
+0
8
1, 14, 196, 2744, 38416, 537824, 7529536, 105413504, 1475789056, 20661046784, 289254654976, 4049565169664, 56693912375296, 793714773254144, 11112006825558016, 155568095557812224, 2177953337809371136, 30491346729331195904, 426878854210636742656, 5976303958948914397184, 83668255425284801560576 (list; graph; listen)
OFFSET

0,2

COMMENT

A000005(a(n)) = A000290(n+1). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2007

Number of n-permutations of 15 objects: l, m, n, o, p, q, r, s, t, u, v, w, z, x, y with repetition allowed and containing no u's, (u-free). Permutations with repetitions! If n=0 then 1 >>14^0=1 "". (no u's.) If n=1 then 13 >>14^1=14, >> l, m, n, o, p, q, r, s, t, v, w, z, x, y. (no u's.) etc. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 01 2009]

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Tanya Khovanova, Recursive Sequences

Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 278

FORMULA

G.f.: 1/(1-14x), e.g.f.: exp(14x)

MAPLE

A001023:=-1/(-1+14*z); [Conjectured by S. Plouffe in his 1992 dissertation.]

PROGRAM

(Other) sage: [lucas_number1(n, 14, 0) for n in xrange(1, 18)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2009]

CROSSREFS

Adjacent sequences: A001020 A001021 A001022 this_sequence A001024 A001025 A001026

Sequence in context: A055759 A086946 A007655 this_sequence A067221 A072533 A041085

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 19 2000

More terms from Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 06 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 19:30 EST 2009. Contains 166227 sequences.


AT&T Labs Research