Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082429
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082429 a(n) is the cardinality of the smallest subset S1 of S={1,2,3,...,n} such that every element of S is either in S1 or is the sum of two elements of S1. +0
1
1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(6)=3 since, for S1={1,2,4}, we have 1=1, 2=2, 3=1+2, 4=4, 5=1+4 and 6=2+4, and no set S1 with fewer than three elements has the required property.

CROSSREFS

Sequence in context: A132914 A060646 A103298 this_sequence A047744 A054846 A084520

Adjacent sequences: A082426 A082427 A082428 this_sequence A082430 A082431 A082432

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Apr 24 2003

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research