Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A109010
%S A109010 7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,
%T A109010 7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,
%U A109010 7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1
%N A109010 GCD(n,7).
%F A109010 a(n) = 1 + 6*[7|n], where [x|y] = 1 when x divides y, 0 otherwise.
%F A109010 a(n) = a(n-7).
%F A109010 Multiplicative with a(p^e, 7) = GCD(p^e, 7). David W. Wilson (davidwwilson(AT)comcast.net) 
               Jun 12, 2005.
%Y A109010 Cf. A109004.
%Y A109010 Sequence in context: A055061 A074465 A081229 this_sequence A117825 A010143 
               A101027
%Y A109010 Adjacent sequences: A109007 A109008 A109009 this_sequence A109011 A109012 
               A109013
%K A109010 nonn,easy,mult
%O A109010 0,1
%A A109010 Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)

    
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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research