login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126883 (2^0)*(2^1)*(2^2)*(2^3)...(2^n)-1 = 2^T_n-1 (cf. A000217). 2
0, 1, 7, 63, 1023, 32767, 2097151, 268435455, 68719476735, 35184372088831, 36028797018963967, 7378697629483820643, 302231454903657293676543, 2475880078570760549798248447 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

For n>2 every consecutive pair share at least one factor.

a(n)= A006125(n+1)-1. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 12 2007

Shows how many patterns can be created with 1-color thread while sewing on a button with buttonholes located on the vertices of a convex n-gon. - Ivan N. Ianakiev, Feb 09 2012

REFERENCES

Masha Gessen, Perfect Rigor, A Genius and the Mathematical Breakthrough of the Century, Houghton Mifflin Harcourt, 2009, page 38

MAPLE

seq(2^(binomial(2+n, n))-1, n=-1..12); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 12 2007

CROSSREFS

Sequence in context: A084063 A184141 A152797 * A137810 A036287 A116231

Adjacent sequences:  A126880 A126881 A126882 * A126884 A126885 A126886

KEYWORD

nonn,changed

AUTHOR

Marco Matosic (marcomatosic(AT)hotmail.com), Dec 29 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.