Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068038
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068038 Number of subsets of {1,2,3,...,n} that sum to 0 mod 17. +0
2
1, 1, 1, 1, 1, 1, 3, 8, 15, 30, 60, 120, 241, 482, 964, 1928, 3856, 7712, 15422, 30842, 61682, 123362, 246722, 493446, 986896, 1973790, 3947580, 7895160, 15790320, 31580642, 63161284, 126322568, 252645136, 505290272, 1010580544, 2021161084 (list; graph; listen)
OFFSET

0,7

PROGRAM

(PARI) {A068038(n)=local(v, v1); v=vector(17); v[1]=1; for(i=1, n, v1=vector(17); for(j=0, 16, v1[j+1]=v[j+1]+v[(j-i)%17+1]); v=v1); v[1]} (Max Alekseyev (maxal(AT)cs.ucsd.edu), Jul 23 2005))

CROSSREFS

17th row of A068009.

Sequence in context: A015631 A116686 A135350 this_sequence A090741 A032234 A032255

Adjacent sequences: A068035 A068036 A068037 this_sequence A068039 A068040 A068041

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 11 2002

EXTENSIONS

Rechecked by Max Alekseyev, maxal(AT)cs.ucsd.edu, Jul 23 2005

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research