Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093152
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093152 Number of odd composites 3 mod 4 less than 10^n. +0
3
0, 12, 163, 1881, 20192, 210678, 2167602, 22119050, 224575958, 2272470765, 22940965468, 231196012323, 2326967172345, 23397529032871, 235077714312816, 2360380827753871, 23688221418030854, 237630022854838725 (list; graph; listen)
OFFSET

1,2

FORMULA

Count odd composites 3 mod 4 less than 10^n

For n>1, a(n) = 25*10^(n-2) - A091099(n) [From Max Alekseyev (maxale(AT)gmail.com), May 17 2009]

EXAMPLE

Below 10^2 there are 12 odd composites 3 mod 4 so a(2)=12

CROSSREFS

Cf. A093151 A093153 A091295 A091098 A091099.

Sequence in context: A109391 A138455 A024221 this_sequence A143583 A046174 A055760

Adjacent sequences: A093149 A093150 A093151 this_sequence A093153 A093154 A093155

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Mar 24 2004

EXTENSIONS

a(9) from Ryan Propper (rpropper(AT)stanford.edu), Jun 21 2005

Extended by Max Alekseyev (maxale(AT)gmail.com), May 17 2009

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