Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014666 Partial sums of A014665. +0
1
1, 2, 4, 6, 10, 11, 17, 21, 27, 29, 39, 42, 54, 58, 63, 71, 87, 90, 108, 114, 121, 126 (list; graph; listen)
OFFSET

1,2

REFERENCES

S. W. Golomb, personal communication, Svalbard, Norway, 7/97.

FORMULA

For n>1: # of positive integers u <= n(n-1) such that p^H_p(u)<=n for all p<=u, where H_p(u) = highest power of p dividing u.

CROSSREFS

Sequence in context: A086917 A004789 A027435 this_sequence A067852 A102025 A090127

Adjacent sequences: A014663 A014664 A014665 this_sequence A014667 A014668 A014669

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research