The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275392 Smallest term in the tribonacci Zeckendorf representation of n. 2
1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 4, 1, 13, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 24, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 4, 1, 13, 1, 2, 1, 4, 1, 2, 44, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 4, 1, 13, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 24, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 4, 1, 81, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1, 4, 1, 13, 1, 2, 1, 4, 1, 2, 7, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = n if n is in A000073.
EXAMPLE
The tribonacci Zeckendorf representation of 5 is 4+1 (4 and 1 are both tribonacci numbers), the smaller term of which is 1, so a(5)=1.
PROG
(Python)
tribonacci = [0, 0, 1]
seq = []
numTerms = 100
while tribonacci[-1] < numTerms:
tribonacci.append(tribonacci[-1]+tribonacci[-2]+tribonacci[-3])
tribonacci = tribonacci[3:]
tribonacci.reverse()
for n in range(1, numTerms):
tmp = n
smallestTerm = 0
for place in tribonacci:
if tmp >= place:
tmp -= place
smallestTerm = place
seq.append(str(n)+" "+str(smallestTerm))
print('\n'.join(seq))
CROSSREFS
Sequence in context: A268671 A163618 A341691 * A360329 A106616 A268669
KEYWORD
nonn
AUTHOR
Aresh Pourkavoos, Jul 26 2016
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 00:14 EDT 2024. Contains 372720 sequences. (Running on oeis4.)