login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248174 2-adic order of the tribonacci sequence. 1
0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 3, 0, 0, 6, 3, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 4, 0, 0, 6, 4, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 3, 0, 0, 7, 3, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 5, 0, 0, 7, 5, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 3, 0, 0, 6, 3, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 4, 0, 0, 6, 4, 0, 0, 1, 2, 0, 0, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..10000

D. Marques and T. Lengyel, The 2-adic order of the Tribonacci numbers and the equation T_n = m!, J. Int. Seq. 17 (2014) # 140.10.1

FORMULA

a(n) = A007814(A000073(n+1)). - Michel Marcus, Oct 03 2014

EXAMPLE

For n = 7 we have T_7 = A000073(8) = 24 and the highest power of 2 dividing T_7 is 8 = 2^3.

MAPLE

b:= n-> (<<0|1|0>, <0|0|1>, <1|1|1>>^n. <<0, 1, 1>>)[1, 1]:

a:= n-> padic[ordp](b(n), 2):

seq(a(n), n=1..120);  # Alois P. Heinz, Oct 03 2014

CROSSREFS

Cf. A000073, A007814.

Sequence in context: A319668 A167634 A174169 * A125095 A113411 A260110

Adjacent sequences:  A248171 A248172 A248173 * A248175 A248176 A248177

KEYWORD

nonn

AUTHOR

Jeffrey Shallit, Oct 03 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 04:34 EDT 2020. Contains 335763 sequences. (Running on oeis4.)