Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087719
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087719 Least number m such that the number of numbers k<=m with k>spf(k)^n exceeds the number of numbers with k<=spf(k)^n. +0
1
15, 27, 57, 135, 345, 927, 2577, 7335, 21225, 62127, 183297, 543735, 1618905 (list; graph; listen)
OFFSET

1,1

COMMENT

m<a(n): #{k: k>spf(k)^n & 1<=k<=m} <= m/2;

m>=a(n): #{k: k>spf(k)^n & 1<=k<=m} > m/2.

FORMULA

Numbers so far satisfy a(n) = 3^n + 3*2^n + 6. - R. Stephan, May 10 2004

CROSSREFS

Cf. A088382, A088382, A088380, A088381, A000430, A080257.

Adjacent sequences: A087716 A087717 A087718 this_sequence A087720 A087721 A087722

Sequence in context: A097222 A004069 A110978 this_sequence A116070 A073766 A031334

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 29 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research