login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105335 a(n) = n*(n+1)/2 mod 64. 0
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 2, 14, 27, 41, 56, 8, 25, 43, 62, 18, 39, 61, 20, 44, 5, 31, 58, 22, 51, 17, 48, 16, 49, 19, 54, 26, 63, 37, 12, 52, 29, 7, 50, 30, 11, 57, 40, 24, 9, 59, 46, 34, 23, 13, 4, 60, 53, 47, 42, 38, 35, 33, 32, 32, 33, 35, 38, 42, 47, 53, 60, 4, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
G.f. = p(x)/q(x) where p(x) has degree 124, and q(x) = (x-1)*(x^2+1)*(x^4+1)*(x^8+1)*(x^16+1)*(x^32+1)*(x^64+1), which has coefficients which are alternately +1 and -1 (when expanded). Compare the g.f. for binary partitions, A018819. - Harvey P. Dale and N. J. A. Sloane, Jul 17 2020
MATHEMATICA
Mod[Accumulate[Range[0, 80]], 64] (* Harvey P. Dale, Jul 17 2020 *)
CROSSREFS
See A105198 for further information.
Cf. A018819.
Sequence in context: A341192 A071817 A033442 * A130489 A211024 A261422
KEYWORD
nonn
AUTHOR
Oscar Takeshita, May 01 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:51 EDT 2024. Contains 371967 sequences. (Running on oeis4.)