Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047563
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A047563
%S A047563 0,3,4,5,6,7,8,11,12,13,14,15,16,19,20,21,22,23,24,27,28,29,30,31,32,
%T A047563 35,36,37,38,39,40,43,44,45,46,47,48,51,52,53,54,55,56,59,60,61,62,63,
%U A047563 64,67,68,69,70,71,72,75,76
%N A047563 Numbers that are congruent to {0, 3, 4, 5, 6, 7} mod 8.
%F A047563 a(n)= (1/9)*{13*(n mod 6)+[(n+1) mod 6]+[(n+2) mod 6]+[(n+3) mod 6]+[(n+4) 
               mod 6]-2*[(n+5) mod 6]} + 8*A054895, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), 
               Nov 05 2007
%Y A047563 Sequence in context: A125684 A089358 A001272 this_sequence A120561 A051016 
               A044951
%Y A047563 Adjacent sequences: A047560 A047561 A047562 this_sequence A047564 A047565 
               A047566
%K A047563 nonn
%O A047563 1,2
%A A047563 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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research