Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047304
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047304 Numbers that are congruent to {1, 2, 3, 4, 5, 6} mod 7. +0
5
1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 64, 65, 66 (list; graph; listen)
OFFSET

1,2

COMMENT

Numbers that are not divisible by 7.

This is different from A020658.

More generally the sequence of numbers not divisible by some fixed integer m>=2 is given by a(n,m)=n-1+floor((n+m-2)/(m-1)). [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]

FORMULA

a(n)=n-1+floor((n+5)/6) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]

PROGRAM

(Other) sage: [i for i in range(67) if gcd(7, i) == 1] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 21 2009]

(PARI) a(n)=n-1+floor((n+5)/6) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]

CROSSREFS

Sequence in context: A000378 A022551 A020659 this_sequence A020658 A043092 A023801

Adjacent sequences: A047301 A047302 A047303 this_sequence A047305 A047306 A047307

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research