Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124909 a(n) = least integer j>=0 such that n=Floor[(4^j)/(3^k)] for some integer k>=0. +0
2
0, 3, 4, 1, 2, 14, 3, 15, 4, 12, 16, 5, 9, 13, 21, 2, 10, 14, 18, 22, 3, 7, 11, 15, 38, 19, 23, 4, 8, 31, 12, 35, 16, 39, 20, 24, 5, 28, 9, 32, 97, 13, 36, 17, 40, 21, 44, 151, 25, 6, 29, 136, 10, 33, 98, 14, 37, 102, 18, 41, 148, 22, 45, 3, 26, 175, 7, 72, 30, 53, 11, 34, 267, 15 (list; graph; listen)
page 1

Search completed in 0.001 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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research