Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007690
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007690 Number of partitions of n in which no part occurs just once.
(Formerly M0167)
+0
11
1, 0, 1, 1, 2, 1, 4, 2, 6, 5, 9, 7, 16, 11, 22, 20, 33, 28, 51, 42, 71, 66, 100, 92, 147, 131, 199, 193, 275, 263, 385, 364, 516, 511, 694, 686, 946, 925, 1246, 1260, 1650, 1663, 2194, 2202, 2857, 2928, 3721, 3813, 4866, 4967, 6257, 6487, 8051, 8342, 10369 (list; graph; listen)
OFFSET

0,5

COMMENT

Euler transform of period 6 sequence [0,1,1,1,0,1,...]. - Michael Somos Apr 21 2004

Also number of partitions of n into parts, each larger than 1, such that consecutive integers do not both appear as parts. Example: a(6)=4 because we have [6],[4,2],[3,3], and [2,2,2]. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 16 2006

Also number of partitions of n into parts divisible by 2 or 3. - Alexander E. Holroyd (holroyd(AT)math.ubc.ca), May 28 2008

REFERENCES

G. E. Andrews, Number Theory, Dover Publications, 1994. page 197. MR1298627

R. Honsberger, Mathematical Gems III, M.A.A., 1985, p. 242.

George E. Andrews, The Theory of Partitions, Addison-Wesley, Reading, Mass., 1976, p. 14, Example 9.

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976 (p. 14, Example 9).

P. A. MacMahon, Combinatory Analysis, Cambridge Univ. Press, London and New York, Vol. 1, 1915 and Vol. 2, 1916; see vol. 2, p 54, Article 300.

LINKS

A. E. Holroyd, T. M. Liggett and D. Romik, Integrals, partitions, and cellular automata

Eric Weisstein's World of Mathematics, Partition Function P

FORMULA

G.f.: Prod{k>0 is a multiple of 2 or 3} (1/(1-x^k)). - Christian G. Bower (bowerc(AT)usa.net), Jun 23 2000

G.f.: product{i=1, oo, (1+x^3j)/(1-x^2j)} - Jon Perry (perry(AT)globalnet.co.uk), Mar 29 2004

G.f. is a period 1 Fourier series which satisfies f(-1 / (864 t)) = 1/6 (t/i)^(-1/2) g(t) where q = exp(2 pi i t) and g(t) is g.f. for A137566. - Michael Somos, Jan 26 2008

EXAMPLE

a(6)=4 because we have [3,3],[2,2,2],[2,2,1,1], and [1,1,1,1,1,1].

q + q^49 + q^73 + 2*q^97 + q^121 + 4*q^145 + 2*q^169 + 6*q^193 + ...

MAPLE

G:=product((1-x^j+x^(2*j))/(1-x^j), j=1..70): Gser:=series(G, x=0, 60): 1, seq(coeff(Gser, x^n), n=1..54); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 10 2006

PROGRAM

(PARI) a(n)=local(A); if(n<0, 0, A=x*O(x^n); polcoeff(eta(x^6+A)/eta(x^2+A)/eta(x^3+A), n)) /* Michael Somos Apr 21 2004 */

CROSSREFS

Cf. A000041, A055922, A055923, A114917, A114918.

Sequence in context: A065423 A008733 A004795 this_sequence A074364 A008796 A079966

Adjacent sequences: A007687 A007688 A007689 this_sequence A007691 A007692 A007693

KEYWORD

nonn

AUTHOR

njas, Robert G. Wilson v (rgwv(AT)rgwv.com)

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research