Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034260
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034260 Largest m such that A034258(m) <= n. +0
3
3, 8, 13, 15, 19, 23, 26, 31, 33, 37, 39, 45, 48, 50, 56, 57, 61, 64, 67, 71, 76, 79, 83, 86, 89, 92, 93, 99, 103, 107, 110, 113, 114, 117, 124, 124, 127, 129, 134, 139, 142, 144, 146, 152, 155, 158, 160, 167, 167, 171, 175, 175, 179, 186, 186, 191, 194, 199 (list; graph; listen)
OFFSET

1,1

COMMENT

Since A034258 is obviously monotonic non-decreasing then A034260(n) = A034259(n+1)-1. - Larry Reeves (larryr(AT)acm.org), Jan 06 2005

REFERENCES

R. K. Guy and J. L. Selfridge, Factoring factorial n, Amer. Math. Monthly, 105 (1998), 766-767.

CROSSREFS

Cf. A034258, A034259.

Sequence in context: A023734 A045296 A065042 this_sequence A080706 A024615 A045188

Adjacent sequences: A034257 A034258 A034259 this_sequence A034261 A034262 A034263

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Jan 06 2005

Verified by Don Reble (djr(AT)nk.ca), Apr 22 2007

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research