Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082898
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082898 a(n) = A082895[n]/n. +0
1
1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = floor[(floor(n/2)+sigma[n])/n], sigma() = A000203().

MATHEMATICA

Table[Floor[(Floor[n/2]+DivisorSigma[1, n])/n], {n, 1, 100}]

CROSSREFS

Cf. A082893-A082901.

Sequence in context: A134451 A066788 A023126 this_sequence A095999 A058656 A033111

Adjacent sequences: A082895 A082896 A082897 this_sequence A082899 A082900 A082901

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 22 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 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research