Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082479 a(1)=1, a(n)=a(floor(n/2))+a(floor(n/3)). +0
1
1, 2, 2, 3, 3, 4, 4, 5, 5, 5, 5, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 9, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 28, 28, 28, 28, 28, 28 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)*log(n)/n is bounded.

PROGRAM

(PARI) a(n)=if(n<2, 1, a(floor(n/2))+a(floor(n/3)))

CROSSREFS

Sequence in context: A035100 A085089 A069924 this_sequence A090616 A067434 A104103

Adjacent sequences: A082476 A082477 A082478 this_sequence A082480 A082481 A082482

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 27 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research