This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245350 Sum of digits of n written in fractional base 9/4. 0
 0, 1, 2, 3, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 9, 10, 11, 12, 8, 9, 10, 11, 12, 13, 14, 15, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15, 11, 12, 13, 14, 15, 16, 17, 18, 19, 10, 11, 12, 13, 14, 15, 16, 17, 18, 14, 15, 16, 17, 18, 19, 20, 21, 22, 8, 9, 10, 11, 12, 13, 14, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The base 9/4 expansion is unique and thus the sum of digits function is well-defined. LINKS FORMULA a(n) = A007953(A024652(n)). EXAMPLE In base 9/4 the number 16 is represented by 47 and so a(16) = 4 + 7 = 11. PROG (Sage) def basepqsum(p, q, n): ....L=[n] ....i=1 ....while L[i-1]>=p: ........x=L[i-1] ........L[i-1]=x.mod(p) ........L.append(q*floor(x/p)) ........i+=1 ....return sum(L) [basepqsum(9, 4, i) for i in [0..100]] CROSSREFS Cf. A024652, A007953, A000120, A053830, A244040. Sequence in context: A160597 A282779 A305902 * A245354 A097377 A234741 Adjacent sequences:  A245347 A245348 A245349 * A245351 A245352 A245353 KEYWORD nonn,base AUTHOR Tom Edgar, Jul 18 2014 STATUS approved

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

Last modified October 22 11:13 EDT 2018. Contains 316438 sequences. (Running on oeis4.)