Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088265 Numbers == 1,3,7,or 9 (mod 10^(n+1)) in increasing order. +0
3
11, 13, 17, 19, 101, 103, 107, 109, 1001, 1003, 1007, 1009, 10001, 10003, 10007, 10009, 100001, 100003, 100007, 100009, 1000001, 1000003, 1000007, 1000009 (list; graph; listen)
OFFSET

0,1

FORMULA

a(4n+r) = 10^(n+1) + k, (r, k) = (1, 1), (2, 3), (3, 7) or (4, 9).

CROSSREFS

Cf. A088066.

Sequence in context: A068492 A045707 A032591 this_sequence A090149 A089691 A036979

Adjacent sequences: A088262 A088263 A088264 this_sequence A088266 A088267 A088268

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 28 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research