Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071997
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071997 a(n) is the smallest positive integer that cannot be obtained by using the number 2 at most n times and the operators +, -, *, /. +0
1
1, 3, 5, 7, 11, 19, 27, 43, 75, 115, 171, 307, 555, 691, 1383, 2467, 3627 (list; graph; listen)
OFFSET

1,2

LINKS

G. Bannay, LE COMPTE EST BON

EXAMPLE

a(3)=5 because using 2 at most thrice we can get 2/2=1, 2=2, 2+(2/2)=3, 2+2=4, but we cannot obtain 5 in the same way.

CROSSREFS

Sequence in context: A144427 A082603 A161420 this_sequence A093442 A155008 A137814

Adjacent sequences: A071994 A071995 A071996 this_sequence A071998 A071999 A072000

KEYWORD

hard,more,nonn

AUTHOR

Koksal Karakus (karakusk(AT)hotmail.com), Jun 17 2002

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research