Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128266
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128266 a(n) = sum{m=1 to n} GCD(s(n,m),S(n,m)), where s(n,m) is an unsigned Stirling number of the first kind and S(n,m) is a Stirling number of the second kind. +0
2
1, 2, 5, 9, 22, 68, 163, 136, 525, 14519, 3918, 5954, 26561, 23897, 875479, 464545, 303146, 1576515, 15328385, 1297494, 25992621, 92698823, 64096034, 31484634, 16667307085, 737157766, 397339059223, 115011291216, 30816653208, 4304179162 (list; graph; listen)
OFFSET

1,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

MAPLE

with(combinat): T:=(n, k)->gcd(abs(stirling1(n, k)), stirling2(n, k)): seq(add(T(n, k), k=1..n), n=1..35); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 25 2007

CROSSREFS

Sequence in context: A029726 A052962 A002935 this_sequence A088356 A047044 A109621

Adjacent sequences: A128263 A128264 A128265 this_sequence A128267 A128268 A128269

KEYWORD

nonn

AUTHOR

Leroy Quet Feb 22 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 25 2007

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research