cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A105335 a(n) = n*(n+1)/2 mod 64.

This page as a plain text file.
%I A105335 #12 Apr 18 2025 14:37:03
%S A105335 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,
%T A105335 5,31,58,22,51,17,48,16,49,19,54,26,63,37,12,52,29,7,50,30,11,57,40,
%U A105335 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
%N A105335 a(n) = n*(n+1)/2 mod 64.
%C A105335 Periodic with period length 128. - _Ray Chandler_, Apr 18 2025
%H A105335 <a href="/index/Rec#order_127">Index entries for linear recurrences with constant coefficients</a>, order 127.
%F A105335 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
%t A105335 Mod[Accumulate[Range[0,80]],64] (* _Harvey P. Dale_, Jul 17 2020 *)
%Y A105335 See A105198 for further information.
%Y A105335 Cf. A018819.
%K A105335 nonn
%O A105335 0,3
%A A105335 _Oscar Takeshita_, May 01 2005