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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065026 a(1) = 1; for n>1, a(n) = smallest number which is not a sum or product of any subset of the numbers a(1) to a(n-1). 2
1, 2, 4, 9, 17, 25, 59, 67, 176, 226, 578, 628, 1340, 1876, 4472, 5728, 13952, 17704, 43112, 54568, 133088, 168496, 410720, 519856, 1267568, 1604560, 3911840, 4951552, 12072512, 15281632, 37257248, 47160352, 114980864, 145544128, 354845696, 449166400, 1095100352, 1386188608 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

a(4) = 9 because the possible sums and products of one or more terms from a(1), a(2), a(3) are 1, 2, 4, 1+2, 1+4, 2+4, 1+2+4, 1, 2, 4, 1*2, 1*4, 2*4, 1*2*4 = 1, 2, 4, 3, 5, 6, 7, 1, 2, 4, 2, 4, 8, 8. The smallest missing number is 9.

CROSSREFS

Sequence in context: A063981 A131095 A136379 * A199205 A192967 A182806

Adjacent sequences:  A065023 A065024 A065025 * A065027 A065028 A065029

KEYWORD

nonn,nice

AUTHOR

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Nov 02 2001

EXTENSIONS

More terms from Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jun 17 2007

a(35)-a(38) from Donovan Johnson, Jan 11 2011

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 16 07:06 EST 2012. Contains 205870 sequences.