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.

A099546 Odd part of n modulo 5.

This page as a plain text file.
%I A099546 #12 Aug 29 2024 09:16:13
%S A099546 1,1,3,1,0,3,2,1,4,0,1,3,3,2,0,1,2,4,4,0,1,1,3,3,0,3,2,2,4,0,1,1,3,2,
%T A099546 0,4,2,4,4,0,1,1,3,1,0,3,2,3,4,0,1,3,3,2,0,2,2,4,4,0,1,1,3,1,0,3,2,2,
%U A099546 4,0,1,4,3,2,0,4,2,4,4,0,1,1,3,1,0,3,2,1,4,0,1,3,3,2,0,3,2,4,4,0,1,1
%N A099546 Odd part of n modulo 5.
%H A099546 Amiram Eldar, <a href="/A099546/b099546.txt">Table of n, a(n) for n = 1..10000</a>
%F A099546 a(n) = A010874(A000265(n)).
%F A099546 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2. - _Amiram Eldar_, Aug 29 2024
%t A099546 a[n_] := Mod[n / 2^IntegerExponent[n, 2], 5]; Array[a, 100] (* _Amiram Eldar_, Aug 29 2024 *)
%o A099546 (PARI) a(n) = (n>>valuation(n, 2))%5 \\_Charles R Greathouse IV_, May 14 2014
%Y A099546 Cf. A000265, A010874.
%Y A099546 Cf. A099544, A099545, A099547, A099548, A099549, A099550, A099551.
%K A099546 nonn,easy
%O A099546 1,3
%A A099546 _Ralf Stephan_, Oct 23 2004