Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159667
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A159667
%S A159667 1,2,6,26,133,905,6521,57126,544820,5878219,66851119,881424550,
%T A159667 11803494823,175906313032,2767829058956,47008174824136,821285150996811,
%U A159667 15816596073011143,308160754687446289,6498330632792677804
%N A159667 For n >= 1, a(n) = A159666(n)/n.
%C A159667 a(n) is divisible by n, for all n >= 1.
%t A159667 f[n_] := f[n] = Sum[Binomial[n, k] GCD[n, k] f[k - 1], {k, n}]; f[0] 
               = 1; Table[f@n/n, {n, 22}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), 
               May 27 2009]
%Y A159667 A159666
%Y A159667 Sequence in context: A030850 A030951 A030876 this_sequence A030957 A030898 
               A002788
%Y A159667 Adjacent sequences: A159664 A159665 A159666 this_sequence A159668 A159669 
               A159670
%K A159667 nonn
%O A159667 1,2
%A A159667 Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Apr 19 2009
%E A159667 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), May 27 2009

    
page 1

Search completed in 0.001 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research