Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

FORMULA

a(n)=floor[(floor(n/2)+p(n))/n], p(n) is the n-th prime.

MATHEMATICA

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

CROSSREFS

Cf. A082893-A082900.

Sequence in context: A059939 A071842 A085141 this_sequence A079416 A135664 A058318

Adjacent sequences: A082893 A082894 A082895 this_sequence A082897 A082898 A082899

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research